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

deploy

Browse Source
This commit is contained in:
krahets
2023-04-07 22:32:13 +08:00
parent c515efea8b
commit 54b72a3ac9
14 changed files with 226 additions and 229 deletions
Download Patch File Download Diff File Expand all files Collapse all files
chapter_heap/build_heap/index.html
+1 -1
View File
@@ -1942,7 +1942,7 @@ T(h) & = 2 \frac{1 - 2^h}{1 - 2} - h \newline
& = O(2^h)
\end{aligned}
\]</div>
<p>进一步地，高度为 <span class="arithmatex">\(h\)</span> 的完美二叉树的结点数量为 <span class="arithmatex">\(n = 2^{h+1} - 1\)</span> ，易得复杂度为 <span class="arithmatex">\(O(2^h) = O(n)\)</span>。以上推算表明，<strong>输入列表并建堆的时间复杂度为 <span class="arithmatex">\(O(n)\)</span> ，非常高效</strong>。</p>
<p>进一步地，高度为 <span class="arithmatex">\(h\)</span> 的完美二叉树的结点数量为 <span class="arithmatex">\(n = 2^{h+1} - 1\)</span> ，易得复杂度为 <span class="arithmatex">\(O(2^h) = O(n)\)</span> 。以上推算表明，<strong>输入列表并建堆的时间复杂度为 <span class="arithmatex">\(O(n)\)</span> ，非常高效</strong>。</p>