C++ 快速排序

#include "iostream"
#include "bits/stdc++.h"

using namespace std;

void quickSort(vector& nums, int left, int right) {

	if(left>=right) return;

	int pivot = nums[left];
	int i = left;
	int j = right;

	while(i=pivot) {
			--j;
		}
        nums[i] = nums[j];
		while(i nums {3,2,1,19,10,20,23,34,2,23,12,9,8,17};
	quickSort(nums,0, nums.size()-1);
	for(int i:nums) {
		cout<

分治和递归，

递归一定要有结束递归条件