快速排序- c#代码

class QuickSort1
    {
        public static int[] arr = new int[] { 6, 1, 2, 7, 9, 3, 4, 5, 10, 8};
        public static void QuiteSort(int letfIndex, int rightIndex)
        {
            if (letfIndex > rightIndex)
            {
                return;
            }

            int i = letfIndex, j = rightIndex, standard = arr[letfIndex];
            Console.WriteLine("基准数:" + standard);


            while (i != j)
            {
                while (arr[j] >= standard && i < j) j--;
                while (arr[i] <= standard && i < j) i++;
                //交换左右边的数
                if (i < j)
                {
                    Console.WriteLine("准备交换的两个数：" + arr[j] + " " + arr[i]);
                    int temp = arr[i];
                    arr[i] = arr[j];
                    arr[j] = temp;
                }
            }

            //基准数归位
            arr[letfIndex] = arr[i];
            arr[i] = standard;

            //左边递归
            QuiteSort(letfIndex, j - 1);
            //右边递归
            QuiteSort(i + 1, rightIndex);

        }
    }