void Qsort(int num[], int startIndex, int endIndex)
{
if (startIndex >= endIndex)
{
return;
}
int first = startIndex;
int last = endIndex;
int key = num[first];
while (first < last)
{
while (first < last && key <= num[last])
{
--last;
}
num[first] = num[last];
while (first < last && key >= num[first])
{
++first;
}
num[last] = num[first];
}
num[first] = key;
Qsort(num, startIndex, first - 1);
Qsort(num, first + 1, startIndex);
}
快速排序
最新推荐文章于 2024-07-17 10:35:12 发布