mirror of
https://github.com/krahets/hello-algo.git
synced 2026-02-12 07:05:42 +08:00
Polish the chapter
introduction, computational complexity.
This commit is contained in:
@@ -20,7 +20,7 @@ public class heap_sort {
|
||||
ma = l;
|
||||
if (r < n && nums[r] > nums[ma])
|
||||
ma = r;
|
||||
// 若节点 i 最大或索引 l, r 越界,则无需继续堆化,跳出
|
||||
// 若节点 i 最大或索引 l, r 越界,则无须继续堆化,跳出
|
||||
if (ma == i)
|
||||
break;
|
||||
// 交换两节点
|
||||
|
||||
Reference in New Issue
Block a user