快排SDUT

void qsort(int a[], int low, int high)
{
int x = a[low], i = low, j = high;
if(low >= high)
return;
while(i < j)
{
if(i < j && a[j] >= x)
j–;
a[i] = a[j];
if(i < j && a[i] <= x)
i++;
a[j] = a[i];
}
a[i] = x;
qsort(a,low, i - 1);
qsort(a,i + 1, high);
}