quick sort 算法 的C++实现

#include#includeusing namespace std;int partition(vector &A,int left,int right){ int pivot=A[left]; int pl=left; int pr=right; while(pl<pr){ while(pl<pr&&A[pl]<pivot) pl++; while(plpivot) pr--; swap(A[pl],A[pr]); } A[pl]=pivot; return pl;};void quick_sort(vector&A, int left,int right){ int idx=partition(A,left,right); cout<<"test idx:"<<idx<<endl; for( auto a:A) cout<<a<<" "; cout<left) quick_sort(A, left, idx-1); if(idx+1<right) quick_sort(A, idx+1, right);}int main(){ vectorA={3,5,7,9,1,8,2,6,4}; quick_sort(A, 0, A.size()-1); for( auto a:A) cout<<a<<endl;return 0;}