快速排序 Java

public void quickSort(int[] arr){
    quickSort(arr,0,arr.length-1);
}
private void quickSort(int[] arr,int left,int right){
    if(left>=right){
        return;
    }
    int target =arr [left];
    int i = left;
    int j = right;
    while(itarget，左侧arr[i]<=target，这样保证在基准值的左侧是小于等于，右侧是大于
        while(itarget){
            j--;
        }
        while(i