mirror of
https://github.com/krahets/hello-algo.git
synced 2026-04-13 11:39:44 +08:00
deploy
This commit is contained in:
@@ -15,7 +15,7 @@
|
||||
<link rel="canonical" href="https://www.hello-algo.com/chapter_sorting/summary/">
|
||||
|
||||
|
||||
<link rel="prev" href="../merge_sort/">
|
||||
<link rel="prev" href="../counting_sort/">
|
||||
|
||||
|
||||
<link rel="next" href="../../chapter_appendix/installation/">
|
||||
@@ -25,7 +25,7 @@
|
||||
|
||||
|
||||
|
||||
<title>11.6. 小结 - Hello 算法</title>
|
||||
<title>11.7. 小结 - Hello 算法</title>
|
||||
|
||||
|
||||
|
||||
@@ -79,7 +79,7 @@
|
||||
<div data-md-component="skip">
|
||||
|
||||
|
||||
<a href="#116" class="md-skip">
|
||||
<a href="#117" class="md-skip">
|
||||
跳转至
|
||||
</a>
|
||||
|
||||
@@ -113,7 +113,7 @@
|
||||
<div class="md-header__topic" data-md-component="header-topic">
|
||||
<span class="md-ellipsis">
|
||||
|
||||
11.6. 小结
|
||||
11.7. 小结
|
||||
|
||||
</span>
|
||||
</div>
|
||||
@@ -1195,7 +1195,7 @@
|
||||
|
||||
<li class="md-nav__item">
|
||||
<a href="../../chapter_graph/graph_traversal/" class="md-nav__link">
|
||||
9.3. 图的遍历
|
||||
9.3. 图的遍历(New)
|
||||
</a>
|
||||
</li>
|
||||
|
||||
@@ -1358,6 +1358,8 @@
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
<label class="md-nav__link" for="__nav_12" id="__nav_12_label" tabindex="0">
|
||||
@@ -1446,6 +1448,20 @@
|
||||
|
||||
|
||||
|
||||
|
||||
<li class="md-nav__item">
|
||||
<a href="../counting_sort/" class="md-nav__link">
|
||||
11.6. 计数排序(New)
|
||||
</a>
|
||||
</li>
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
@@ -1458,7 +1474,7 @@
|
||||
|
||||
|
||||
<a href="./" class="md-nav__link md-nav__link--active">
|
||||
11.6. 小结
|
||||
11.7. 小结
|
||||
</a>
|
||||
|
||||
</li>
|
||||
@@ -1631,7 +1647,7 @@
|
||||
|
||||
|
||||
|
||||
<h1 id="116">11.6. 小结<a class="headerlink" href="#116" title="Permanent link">¶</a></h1>
|
||||
<h1 id="117">11.7. 小结<a class="headerlink" href="#117" title="Permanent link">¶</a></h1>
|
||||
<ul>
|
||||
<li>冒泡排序通过交换相邻元素来实现排序。通过增加标志位实现提前返回,我们可将冒泡排序的最佳时间复杂度优化至 <span class="arithmatex">\(O(N)\)</span> 。</li>
|
||||
<li>插入排序每轮将待排序区间内元素插入至已排序区间的正确位置,从而实现排序。插入排序的时间复杂度虽为 <span class="arithmatex">\(O(N^2)\)</span> ,但因为总体操作少而很受欢迎,一般用于小数据量的排序工作。</li>
|
||||
@@ -1722,7 +1738,7 @@
|
||||
<nav class="md-footer__inner md-grid" aria-label="页脚" >
|
||||
|
||||
|
||||
<a href="../merge_sort/" class="md-footer__link md-footer__link--prev" aria-label="上一页: 11.5. &nbsp; 归并排序" rel="prev">
|
||||
<a href="../counting_sort/" class="md-footer__link md-footer__link--prev" aria-label="上一页: 11.6. &nbsp; 计数排序(New)" rel="prev">
|
||||
<div class="md-footer__button md-icon">
|
||||
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M20 11v2H8l5.5 5.5-1.42 1.42L4.16 12l7.92-7.92L13.5 5.5 8 11h12Z"/></svg>
|
||||
</div>
|
||||
@@ -1731,7 +1747,7 @@
|
||||
<span class="md-footer__direction">
|
||||
上一页
|
||||
</span>
|
||||
11.5. 归并排序
|
||||
11.6. 计数排序(New)
|
||||
</div>
|
||||
</div>
|
||||
</a>
|
||||
|
||||
Reference in New Issue
Block a user