快速排序 quickSort

自用留档

import java.util.Arrays;
public class quickSort {
    public static void main(String[] args)
    {
        int[] arr={4,8,6,2,12,85,36,14,25,35,52,200,30,68,98,58};
        QuickSort(arr,0,arr.length-1);
        System.out.println(Arrays.toString(arr));
    }
    static void QuickSort(int[] arr,int l , int r){
        if(l < r){
            int index = getIndex(arr,l,r);
            QuickSort(arr,l,index-1);
            QuickSort(arr,index+1,r);
        }
    }
    static int getIndex(int[] arr , int start,int end){
        int i = start , j = end;
        int x = arr[start];
        while(i < j){
            while(i<j && arr[j] > x) j--;
            if(i<j)
                arr[i++] = arr[j];
            while(i<j && arr[i] < x) i++;
            if(i<j)
                arr[j--] = arr[i];
        }
        arr[i] = x;
        return i;
    }
}