- void QuickSort(int A[],int n,int left,int right)
- {
- int i,j,t;
- if(left<right)
- {
- i=left,j=right+1;
- while(1){
- while(i+1<n&&A[++i]<A[left]);
- while(j-1>-1&&A[--j]>A[right]);
- if(i>=j)break;
- t=A[i],A[i]=A[j],A[j]=t;
- }
- t=A[left],A[left]=A[j],A[j]=t;
- QuickSort(A,n,left,t-1);
- QuickSort(A,n,t+1,right);
- }
- }
- c++
来源: http://www.bubuko.com/infodetail-2974432.html