参考https://blog.csdn.net/qq_28584889/article/details/88136498
package sort;
import java.util.Arrays;
public class QuickSort {
public static void main(String[] args) {
int arr[] = {3,-9,-1,-10,-2,9,66,99,666};
quickSort(arr,0,arr.length-1);
System.out.println(Arrays.toString(arr));
}
private static void quickSort(int arr[],int left,int right) {
if(left >=right) {
return;
}
int base = arr[left];
int i = left+1;
int j = right;
int temp;
while ( i < j ) {
while (arr[j] > base && i<j) {
j--;
}
while (arr[i] <= base && i<j) {
i++;
}
if( i < j ) {
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
arr[left] = arr[i];
arr[i] = base;
quickSort(arr,left,i-1);
quickSort(arr,i+1,right);
}
}