快速排序

void quick_sort(vector<int>& nums, int l, int r){
        if(l >= r) return;
        int i = l, j = r, x = nums[j];
        while(i < j){
            while(nums[i] <= x && i < j) i++;
            nums[j] = nums[i];
            while(nums[j] >= x && i < j) j--;
            nums[i] = nums[j];
        }
        nums[i] = x;
        quick_sort(nums, l, i - 1);
        quick_sort(nums, i + 1, r);
    }
    ```