快速排序Java实现

public class Sort {    public static int [] quickSort(int []a,int low,int high){        if(low<high){            int middle = Partition(a,low,high);            quickSort(a,0,middle-1);            quickSort(a,middle+1,high);        }        return a;    }    public static int Partition(int []a,int left,int right){        int pivot = a[left];        while(left<right&&pivot<=a[right]){            right--;        }        if(left < right){            a[left++] = a[right];        }        while(left<right&&pivot>=a[left]){            left++;        }        if(left<right){            a[right--] = a[left];        }        a[left] = pivot;        return left;    }    public static void main(String []args){        int []a = {7,2,3,1,10,8,9,4,5,6};        quickSort(a,0,a.length-1);        for(int i=0;i<a.length;i++){            System.out.print(a[i]);        }    }}