public void sort(int[] n,int left,int right){
if(left < right){
int tag = oneSort(n,left,right);
sort(n,left,tag-1);
sort(n,tag+1,right);
}
}
public int oneSort(int[] n,int left,int right){
//把第一个做为中间值
mid = n[left];
while(left<right){
while(left<right && n[right]>=mid){
right--;
}
if(left<right){
n[left++] = n[right];
}
while(left<right && n[left]<=mid){
left ++;
}
if(left<right){
n[right--] = n[left]
}
}
n[left] = mid;
return left;
}