选择排序法

int[] arr = new int[] { 3, 6, 14, 65, 2, 7, 93, 1, 55 };  //选择排序法
            foreach (int n in arr)
                Console.Write("{0}", n + " ");
            Console.WriteLine();
            int min;
            for (int i = 0; i < arr.Length - 1; i++)
            {
                min = i;
                for (int j = i + 1; j < arr.Length; j++)
                {
                    if (arr[j] < arr[min])
                        min = j;

                }
                int t = arr[min];
                arr[min] = arr[i];
                arr[i] = t;

            }
            Console.WriteLine("排序后结果为: ");
            foreach (int n in arr)
                Console.Write("{0}",n+" ");
            Console.WriteLine();