static void quickSort(int [] s,int start,int end){
if(start>end){
return;
}
int mid=(start+end)/2;
int low=start;
int high=end;
int standard=s[start];
while(low<high){
while(s[high]>=standard&&low<high){
--high;
}
while(s[low]<=standard&&low<high){
++low;
}
if(low<high){
int temp=s[high];
s[high]=s[low];
s[low]=temp;
}
}
int temp=s[start];
s[start]=s[low];
s[low]=temp;
quickSort(s,start,mid-1);
quickSort(s,mid+1,end);
}