快速排序实现代码

public class Main {
    static int a[]={6,1,2,7,9,3,4,5,10,8};

    static void quickSort(int left,int right){
        if(left>right) return;
        int base=a[left];
        int i=left;
        int j=right;
        while(i!=j){
            while(a[j]>=base&&i<j)
                j--;
            while(a[i]<=base&&i<j)
                i++;
            if(i<j){
                int temp=a[i];
                a[i]=a[j];
                a[j]=temp;
            }
        }
        a[left]=a[i];
        a[i]=base;
        quickSort(left, j-1);
        quickSort(i+1,right);
    }

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        quickSort(0,9);
        for(int i:a)
            System.out.print(i+" ");
    }

}