CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-26 11:32:31 +08:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2023-07-26 08:59:03 +08:00
parent fd34c845bc
commit 974fea7de4
48 changed files with 299 additions and 299 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
chapter_sorting/radix_sort/index.html
View File

@@ -3379,9 +3379,9 @@
<h2 id="11101">11.10.1. &nbsp; 算法流程<a class="headerlink" href="#11101" title="Permanent link">&para;</a></h2>
<p>以学号数据为例，假设数字的最低位是第 <span class="arithmatex">\(1\)</span> 位，最高位是第 <span class="arithmatex">\(8\)</span> 位，基数排序的步骤如下：</p>
<ol>
<li>初始化位数 <span class="arithmatex">\(k = 1\)</span> ；</li>
<li>对学号的第 <span class="arithmatex">\(k\)</span> 位执行「计数排序」。完成后，数据会根据第 <span class="arithmatex">\(k\)</span> 位从小到大排序；</li>
<li>将 <span class="arithmatex">\(k\)</span> 增加 <span class="arithmatex">\(1\)</span> ，然后返回步骤 <code>2.</code> 继续迭代，直到所有位都排序完成后结束；</li>
<li>初始化位数 <span class="arithmatex">\(k = 1\)</span> 。</li>
<li>对学号的第 <span class="arithmatex">\(k\)</span> 位执行「计数排序」。完成后，数据会根据第 <span class="arithmatex">\(k\)</span> 位从小到大排序。</li>
<li>将 <span class="arithmatex">\(k\)</span> 增加 <span class="arithmatex">\(1\)</span> ，然后返回步骤 <code>2.</code> 继续迭代，直到所有位都排序完成后结束。</li>
</ol>
<p><img alt="基数排序算法流程" src="../radix_sort.assets/radix_sort_overview.png" /></p>
<p align="center"> Fig. 基数排序算法流程 </p>