用 c++ 写一段快速排序算法

#include <iostream>#include <vector>
using namespace std;
int partition(vector<int>& nums, int low, int high){    int pivot = nums[high];    int i = low - 1;     for(int j = low; j < high; j++){        if(nums[j] < pivot){            i++;            swap(nums[i], nums[j]);        }    }    swap(nums[i+1], nums[high]);    return i+1;}
void quickSort(vector<int>& nums, int low, int high){    if(low < high){        int idx = partition(nums, low, high);        quickSort(nums, low, idx-1);        quickSort(nums, idx+1, high);    }}
int main(){    vector<int> nums = {6, 3, 8, 9, 5, 2, 7};
    quickSort(nums, 0, nums.size() - 1);        for(auto num: nums){        cout<<num<<" ";    }    cout<<endl;
    return 0;}