前言
快速排序作为一种非常优秀的排序方法,其思想非常值得借鉴和研究,初次接触可能有些不太好理解,今天就通过画一个图来缕一缕它的实现过程。
# 2 partitional 快速排序
int parititional(int nums[], int low, int high)
{
int pivot = nums[low];
while (low < high)
{
while (low < high && nums[high] >= pivot) #
{
--high;
}
nums[low] = nums[high];
while (low < high && nums[low] <= pivot)
{
++low;
}
nums[high] = nums[low];
}
nums[low] = pivot; #
return low;
}
void quickSort(int nums[], int low, int high)
{
if (low < high)
{
int pivot = parititional(nums, low, high);
quickSort(nums, low, pivot - 1);
quickSort(nums, pivot + 1, high);
}
}