快速排序

void QuickSort(SqList *L)
{
QSort(L,1,L->length);
}


void QSort(SqList *L, int low, int high)
{
int pivot;
if (low<high)
{
pivot = Partition(L,low,high);
QSort(L,low,pivot-1)
QSort(L,pivot+1,high)


}




}




int Partition(SqList *L,int low,int high)
{
int pivotkey;
pivotkey = L->r[low];
while (low<high)
{
while (low<high && L->r[high]>=pivotkey)
{
high--;
}
temp = L->r[high];
L->r[high] = L->r[low];
L->r[low] = temp;
while (low<high && L->r[low]<=pivotkey)
{
low++;
}
temp = L->r[high];
r[high] = L->r[low];
L->r[low] = temp;
 
}
return low;
}
这是交换实现的快速排序，还可以是赋值的更简单。