algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-31 14:23:30 +08:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2023-08-29 20:57:26 +08:00
parent 6ae6c480e0
commit 8c4d24795c
32 changed files with 574 additions and 278 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
chapter_heap/top_k/index.html
View File

@ -3469,7 +3469,7 @@
<div class="admonition tip">
<p class="admonition-title">Tip</p>
<p>当 <span class="arithmatex">\(k = n\)</span> 时，我们可以得到从大到小的序列，等价于“选择排序”算法。</p>
<p>当 <span class="arithmatex">\(k = n\)</span> 时，我们可以得到完整的有序序列，此时等价于“选择排序”算法。</p>
</div>
<h2 id="832">8.3.2 &nbsp; 方法二：排序<a class="headerlink" href="#832" title="Permanent link">&para;</a></h2>
<p>如图 8-7 所示，我们可以先对数组 <code>nums</code> 进行排序，再返回最右边的 <span class="arithmatex">\(k\)</span> 个元素，时间复杂度为 <span class="arithmatex">\(O(n \log n)\)</span> 。</p>