PTA 6-6 快速排序

6-6 快速排序

int Partition(SqList &L,int low,int high){
	L.r[0]=L.r[low];
	int pivotekey=L.r[low].key;
	while(low<high){
		while (low<high&&L.r[high].key>=pivotekey){
			high--;
		}
		L.r[low]=L.r[high];
		while(low<high&&L.r[low].key<=pivotekey){
			low++;
		}
		L.r[high]=L.r[low];
	}
	L.r[low]=L.r[0];
	return low;
}
void QuickSort(SqList &L, int low, int high){
	if(low<high){
		int pivotloc=Partition(L,low,high);
		QuickSort(L,low,pivotloc-1);
		QuickSort(L,pivotloc+1,high);
	}
}