题解 | #排序#

快排

import java.util.*;
public class Solution {
    public int[] MySort (int[] arr) {
       return quickSort(arr,0,arr.length-1);
    }
    public int[] quickSort(int[] arr, int left, int right){
        if(left < right){
            int pivot = partition(arr,left,right);
            quickSort(arr,left,pivot-1);
            quickSort(arr,pivot+1,right);
        }
        return arr;
    }
    public int partition(int[] arr,int left,int right){
        int privot = arr[left];
        while(left < right){
            while(left= privot){
                right--;
            }
            arr[left] = arr[right];
            while(left<right && arr[left]<=privot){
                left++;
            }
            arr[right] = arr[left];
        }
        arr[left] = privot;
        return left;
    }
}