C++ 퀵 정렬 quick sort

C++ quick sort 퀵 정렬

void quickSort(vector<int>& nums, int l, int r) {
    if (l >= r) return;
    int mid = partition(nums, l, r);
    quickSort(nums, l, mid);
    quickSort(nums, mid + 1, r);
}

int partition(vector<int>& nums, int l, int r) {
    int pivot = nums[l];
    while (l < r) {
        while (l < r && nums[r] >= pivot) r--;
        nums[l] = nums[r];
        while (l < r && nums[l] <= pivot) l++;
        nums[r] = nums[l];
    }
    nums[l] = pivot;
    return l;
}