CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-13 14:10:00 +08:00
Code Issues Packages Projects Releases Wiki Activity

Bug fixes and improvements. (#1780)

Browse Source 
* Fix the "尾递归优化" to "递归深度优化" in quick_sort.

* Update landing pages.

* Sync zh and zh-hant versions.

* Sync zh and zh-hant versions.
This commit is contained in:
Yudong Jin
2025-07-10 06:32:25 +08:00
committed by GitHub
parent 6a4d62449c
commit e8dc4736a2
43 changed files with 173 additions and 165 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
codes/c/chapter_sorting/quick_sort.c
View File

@@ -89,9 +89,9 @@ void quickSortMedian(int nums[], int left, int right) {
quickSortMedian(nums, pivot + 1, right);
}
// 以下为尾递归优化的快速排序
// 以下为递归深度优化的快速排序
/* 快速排序（尾递归优化） */
/* 快速排序（递归深度优化） */
void quickSortTailCall(int nums[], int left, int right) {
// 子数组长度为 1 时终止
while (left < right) {
@@ -127,10 +127,10 @@ int main() {
printf("快速排序（中位基准数优化）完成后 nums = ");
printArray(nums1, size);
/* 快速排序（尾递归优化） */
/* 快速排序（递归深度优化） */
int nums2[] = {2, 4, 1, 0, 3, 5};
quickSortTailCall(nums2, 0, size - 1);
printf("快速排序（尾递归优化）完成后 nums = ");
printf("快速排序（递归深度优化）完成后 nums = ");
printArray(nums1, size);
return 0;