代码
public static void quickSort(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 += 1;
}
while(arr[r] > pivot){
r -= 1;
}
if(l >= r){
break;
}
temp = arr[l];
arr[l] = arr[r];
arr[r] = temp;
if(arr[l] == pivot){
r -= 1;
}
if(arr[r] == pivot){
l += 1;
}
}
if(l == r){
l += 1;
r -= 1;
}
if(left < r){
quickSort(arr, left, r);
}
if(right > l){
quickSort(arr, l, right);
}
}
效率
//8000 0000 17781ms
//800 0000 1632ms
//80 0000 154ms
//8 0000 27ms