关于基础排序算法的思考--选择排序

通过比较相邻的数值大小来实现选择排序

时间复杂度：O(n*n)

         int[] a = { 3, 1, 5, 7, 2, 4, 9, 6 };

            for (int i = 0; i < a.Length-1; i++)
            {
                int temp = 0;
                int index = i;
                for (int j = i+1; j < a.Length; j++)
                {
                    if (a[index]>a[j])
                    {
                        index = j;
                    }
                }

                temp = a[index];
                a[index] = a[i];
                a[i] = temp;
            }


            for (int j = 0; j < a.Length; j++)
            {
                Console.WriteLine(a[j] + ",");