快速排序——使用广泛！！！_快速排序之所以熟读快应用广泛的主要原因

void quickSort(int *nums, int left, int right)
{
    if (left > right) return;
    int low = left;
    int high = right;
    int base = nums[left];
    
    while (low < high)
    {
        while (nums[high] >= base && low < high)
        {
            high--;
        }
        nums[low] = nums[high];
     
        while (nums[low] <= base && low < high)
        {
            low++;
        }
        nums[high] = nums[low];
    }
    nums[low] = base;
    
    quickSort(nums, left, low-1);
    quickSort(nums, high+1, right);
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27