快速排序
public static void main(String[] args) {
int[] arr = {8,7,6,2,5,8,2,4,7,6,8};
kuaisu(arr,0,arr.length-1);
}
public static void kuaisu(int[] arr,int left,int right){
int l = left;
int r = right;
int pivot = arr[(left+right)/2];
int temp=0;
while (l<r){
while (arr[l]<pivot){
l++;
}
while (arr[r]>pivot){
r--;
}
if(l>=r){
break;
}
temp=arr[l];
arr[l] = arr[r];
arr[r]=temp;
if(arr[l] == pivot){
System.out.println("l"+arr[l]);
r-=1;
}
if (arr[r] == pivot){
System.out.println(arr[r]);
l++;
}
}
if(l==r){
l++;
r--;
}
if (left<r) {
kuaisu(arr,left,r);
}
if (right>l) {
kuaisu(arr,l,right);
}
}