public static void quick_sort(int[] a,int low ,int high){
if(low>=high){
return ;
}
int index=partition(a,low,high);
quick_sort(a, low, index-1);
quick_sort(a,index+1,high);
}
public static int partition(int []a,int low,int high){
int key=a[low];
while(low < high){
while(a[high]>=key && high > low){
high--;
}
a[low]=a[high];
while(a[low] <= key && high >low){
low ++;
}
a[high]=a[low];
}
a[high]=key;
return high;
}