代码
#include<iostream>
#include<vector>
using namespace std;
void Quick_Sort(vector<int> &data,int left,int right)
{
if(left>=right) return;
int i=left,j=right-1;
int base=data[right];
while(1)
{
while(data[i]<base) ++i;
while(data[j]>=base) --j;
if(i>=j) break;
swap(data[i],data[j]);
}
swap(data[i],data[right]);
Quick_Sort(data,left,i-1);
Quick_Sort(data,i+1,right);
}
int main()
{
vector<int> data{7,8,7,7,6,7,7,9};
Quick_Sort(data,0,data.size()-1);
for(int i=0;i<data.size();++i){
cout<<data[i]<<",";
}
cout<<endl;
return 0;
}