快速排序算法
void QuickSort(int r[] ,int low,int high){
if(low<high){
int mid = Rartition(r,low,high);
QuickSort(r,low,mid-1);
QuickSort(r,mid+1,high);
}
}
分治算法
int Partition(int r[],int low,int high){
int i = low,j=high,pivot=r[low];
while(i<j){
while(i<j&&r[j]>pivot) j—;//向左扫描
if(j<j){
swap(r[i++],r[j]);
}
while(i<j&&r[j]<=pivot) i++;
if(i<j){
swap(r[i],r[j—]);
}
}
return i;
}