手撕代码：快排-笔试面试资料

public static void quickSort(int[] arr,int low, int high){       if(low<high){           int temp = arr[low];           int i = low,j = high;           while(i!=j){               while(i<j && arr[j]>=temp) --j;        //改成 <= 从大到小排序               if(i<j){                   arr[i] = arr[j];                   i++;               }               while(i<j && arr[i] < temp) ++i;      //改成>   从大到小排序                   if(i<j) {                       arr[j] = arr[i];                       j--;                   }           }           arr[i] = temp;           quickSort(arr,low,i-1);           quickSort(arr, i+1,high);       }    }