直接上代码
#include<bits/stdc++.h>
using namespace std;
int reIndex(int a[],int low,int high){
int index=a[low];
while(low<high){
while(low<high&&a[high]>=index){
high--;
}
a[low]=a[high];
while(low<high&&a[low]<=index){
low++;
}
a[high]=a[low];
}
a[low]=index;
return low;
}
void quickSort(int a[],int low,int high){
int myindex=reIndex(a,low,high);
if(low<high){
quickSort(a,low,myindex-1);
quickSort(a,myindex+1,high);
}
}
int main(){
int a[]={2,3,1,5,4,9,6};
quickSort(a,0,6);
for(int i=0;i<7;i++){
cout<<a[i]<<endl;
}
return 0;
}