数据结构作业题(5)

L.r[0]=L.r[low];

pivotkey=L.r[low].key; while (low

while (low=pivotkey)--high; L.r[low]=L.r[high];

while (low

L.r[low]=L.r[0]; return low; }

5.

int Partition (Sqlist &l,int low,int high) {

L.r[0]=L.r[low];

pivotkey=L.r[low].key; while (low

while (low=pivotkey)--high; L.r[low]=L.r[high];

while (low

L.r[low]=L.r[0]; return low; }