快排算法
#include<iostream>
#include<vector>
#include<stdlib.h>
using namespace std;
int partition(vector<int> &vec,int low,int high){
int temp = vec[low];
while(low<high){
while(low<high && vec[high]>=temp){
high--;
}
vec[low]=vec[high];
while(low<high