package 寶典;

/**
 * @ author:mian
 * @ DATA:2018/5/8 11:21
 */
public class 快排 {
    public static void sort(int arr[],int low,int high){
        int i,j;
        int index;
        if(low>high){
            return;
        }
        i=low;
        j=high;
        index = arr[i];
        while(i<j){
            while(i<j&&arr[j]>=index){
                j--;
            }
            if(i<j){
                arr[i++]=arr[j];
            }
            while(i<j&&arr[i]<index){
                i++;
            }
            if(i<j)
                arr[j--]=arr[i];
        }
        arr[i]=index;
        sort(arr,low,i-1);
        sort(arr,i+1,high);
    }
    public static void quickSort(int arr[]){
        sort(arr,0,arr.length-1);
    }

    public static void main(String[] args) {
        int i=0;
        int a[]={5,4,9,8,7,6,0,1,3,2};
        int len = a.length;
        quickSort(a);
        for(int i=0;i<len;i++){
            System.out.println(a[i]+" ");
        }
    }
}