排序算法总结

public class Qsort {
    public static void main(String[] args) {
        int a[]= {3,4,11,2,0,9,8,5,7};
        Quicksort(a,0,a.length-1);
        for (int i : a) {
            System.out.print(i+" ");
        }    
    }
    private static void Quicksort(int[] a, int left, int right) {    
        if(left>right)
            return;
        int i=left;
        int j=right;
        int base=a[left];
        while(i!=j) {
            while(a[j]>=base&&i<j)
                j--;
            while(a[i]<=base&&i<j)
                i++;
            int temp = a[i];
            a[i]= a[j];
            a[j]= temp;
        }
        a[left]=a[i];
        a[i]=base;
        Quicksort(a,left,i-1);
        Quicksort(a,i+1,right);
    }
}