快速排序代码
void quickSort(int *buffer,int l,int r)
{
int x = buffer[l];
int L = l;
int R = r;
if(L >= R)
return;
while(l < r)
{
while(l < r && buffer[r] > x)
r--;
if(l != r)
{
buffer[l] = buffer[r];
l++;
}
while(l < r && buffer[l] < x)
l++;
if(l != r)
{
buffer[r] = buffer[l];
r--;
}
}
buffer[l] = x;
quickSort(buffer, L, l-1);
quickSort(buffer, l+1, R);
}