Polish the chapter

introduction, computational complexity.
2026-02-03 10:53:35 +08:00 · 2023-08-20 14:51:39 +08:00
parent 5fb728b3d6
commit 2626de8d0b
87 changed files with 375 additions and 371 deletions
--- a/codes/cpp/chapter_sorting/heap_sort.cpp
+++ b/codes/cpp/chapter_sorting/heap_sort.cpp
@@ -17,7 +17,7 @@ void siftDown(vector<int> &nums, int n, int i) {
            ma = l;
        if (r < n && nums[r] > nums[ma])
            ma = r;
-        // 若节点 i 最大或索引 l, r 越界，则无需继续堆化，跳出
+        // 若节点 i 最大或索引 l, r 越界，则无须继续堆化，跳出
        if (ma == i) {
            break;
        }