快速排序——Java实现
public void sort(int[] a,int left,int right){
int pivot;
if(left<right){
pivot=QuickSort(a,left,right);
sort(a,left,pivot-1);
sort(a,pivot+1,right);
}
}
public int QuickSort(int []a,int left,int right){
int pivot=a[left];
while (left<right){
while ((left<right)&&pivot<=a[right]){
right--;
}
a[left]=a[right];
while ((left<right)&&pivot>=a[left]){
left++;
}
a[right]=a[left];
}
a[left]=pivot;
return left;
}