CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-03 18:50:58 +08:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2023-05-24 20:56:12 +08:00
parent b2e68ade25
commit 6ff9c19dfe
8 changed files with 133 additions and 66 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
chapter_sorting/bubble_sort/index.html
View File

@@ -1933,7 +1933,7 @@
</div>
</div>
<h2 id="1131">11.3.1. &nbsp; 算法流程<a class="headerlink" href="#1131" title="Permanent link">&para;</a></h2>
<p>设输入数组长度为 <span class="arithmatex">\(n\)</span> ，冒泡排序的步骤为：</p>
<p>设数组的长度为 <span class="arithmatex">\(n\)</span> ，冒泡排序的步骤为：</p>
<ol>
<li>首先，对 <span class="arithmatex">\(n\)</span> 个元素执行“冒泡”，<strong>将数组的最大元素交换至正确位置</strong>，</li>
<li>接下来，对剩余 <span class="arithmatex">\(n - 1\)</span> 个元素执行“冒泡”，<strong>将第二大元素交换至正确位置</strong>。</li>

2
chapter_sorting/selection_sort/index.html
View File

@@ -1878,7 +1878,7 @@
<h1 id="112">11.2. &nbsp; 选择排序<a class="headerlink" href="#112" title="Permanent link">&para;</a></h1>
<p>「选择排序 Selection Sort」的工作原理非常直接：开启一个循环，每轮从未排序区间选择最小的元素，将其放到已排序区间的末尾。</p>
<p>选择排序的算法流程如下：</p>
<p>设数组的长度为 <span class="arithmatex">\(n\)</span> ，选择排序的算法流程如下：</p>
<ol>
<li>初始状态下，所有元素未排序，即未排序（索引）区间为 <span class="arithmatex">\([0, n-1]\)</span> 。</li>
<li>选取区间 <span class="arithmatex">\([0, n-1]\)</span> 中的最小元素，将其与索引 <span class="arithmatex">\(0\)</span> 处元素交换。完成后，数组前 1 个元素已排序。</li>