C# 简洁的快速排序

/// <summary>
/// 快排
/// </summary>
/// <param name="nums">需要排序的数组</param>
/// <param name="left">数组左边界(0)</param>
/// <param name="right">数组右边界(nums.Length-1)</param>

static void QuickSort(int[] nums, int left, int right) 
{
    if (left < right)
    {
        int i = left;
        int j = right;
        int mid = nums[(left + right) / 2];

        while (true)
        {//从左开始，若nums[i]<mid，缩小边界，若不是则停止
            while (i < right && nums[i] < mid) { i++; }
            while (j > 0 && nums[j] > mid) { j--; }//同上理
            if (i == j) break;//边界重合，双指针遍历结束，退出loop

            int temp = nums[i];
            nums[i] = nums[j];
            nums[j] = temp;
            if (nums[i] == nums[j]) j--;
        }
        QuickSort(nums, left, i);
        QuickSort(nums, i + 1, right);
    }
}