void Qsort(int a[],int low,int high)
{
int first,last;
first=low;
last=high;
int min=a[low];
while(first<last)
{
while(first<last&&a[last]>=min)
last--;
min=a[last];
while(first<last&&a[first]<=min)
first++;
a[last]=a[first];
a[first]=min;
sort(a,low,first-1);
sort(a,first+1,high);
}
}
转载于:https://my.oschina.net/u/1446208/blog/384039