#include<iostream>
using namespace std;
int partition(int A[],int low ,int high){
int pivot=A[low];
while(low<high){
while(low<high&&A[high]>=pivot){
--high;
}
A[low]=A[high];
while(low<high&&A[low]<=pivot){
++low;
}
A[high]=A[low];
}
A[low]=pivot;
return low;
}
void quicksort(int A[],int low,int high){
if(low<high){
int pivotpos=partition(A,low,high);
quicksort(A,low,pivotpos-1);
quicksort(A,pivotpos+1,high);
}
}
int main(){
int A[8]={9,3,4,3,2,4,1,32};
quicksort(A,0,7);
for(int k=0;k<8;k++)
{
cout<<A[k]<<endl;
}
return 0;
}
quicksort.cpp
最新推荐文章于 2020-07-15 08:42:13 发布