数据结构&算法学习笔记: 快速排序

int Partition(int L[], int low, int high)//对子表进行一趟排序，返回枢轴位置
{//L[0]闲置或用作哨兵单元
L[0] = L[low];
int pivotkey = L[low];
while(low < high)
{
while(low < high && L[high] >= pivotkey) --high;
L[low] = L[high];
while(low < high && L[low] <= pivotkey) ++low;
L[high] = L[low];
}
L[low] = L[0];
return low;
}
void Qsort(int L[], int low, int high)
{//L[0]闲置，调用前置初值 low = 1, high = L的length;
if(low < high)
{
int pivotloc = Partition(L, low ,high);//pivotloc是枢轴位置
Qsort(L, low, pivotloc - 1);
Qsort(L, pivotloc + 1, high);
}
}

int Patition(int L[], int low, int high)
{
int temp = L[low];
while(low < high)
{
int pivotkey = L[low];
while(low < high && L[high] >= pivotkey)high--;
L[low] = L[high];
while(low < high && L[low] <= pivotkey)low++;
L[high] = L[low];
}
L[low] = temp;
return low;
}

void Qsort(int L[], int low, int high)
{//调用前置low = 0, high = L.length - 1
if(low < high)
{
int pivotloc = Patition(L, low, high);
Qsort(L, low, pivotloc - 1);
Qsort(L, pivotloc + 1, high);
}
}