mirror of
https://github.com/krahets/hello-algo.git
synced 2025-08-02 03:02:31 +08:00
deploy
This commit is contained in:
@ -3393,9 +3393,9 @@
|
||||
<h2 id="1181">11.8.1. 算法流程<a class="headerlink" href="#1181" title="Permanent link">¶</a></h2>
|
||||
<p>考虑一个长度为 <span class="arithmatex">\(n\)</span> 的数组,元素是范围 <span class="arithmatex">\([0, 1)\)</span> 的浮点数。桶排序的流程如下:</p>
|
||||
<ol>
|
||||
<li>初始化 <span class="arithmatex">\(k\)</span> 个桶,将 <span class="arithmatex">\(n\)</span> 个元素分配到 <span class="arithmatex">\(k\)</span> 个桶中;</li>
|
||||
<li>对每个桶分别执行排序(本文采用编程语言的内置排序函数);</li>
|
||||
<li>按照桶的从小到大的顺序,合并结果;</li>
|
||||
<li>初始化 <span class="arithmatex">\(k\)</span> 个桶,将 <span class="arithmatex">\(n\)</span> 个元素分配到 <span class="arithmatex">\(k\)</span> 个桶中。</li>
|
||||
<li>对每个桶分别执行排序(本文采用编程语言的内置排序函数)。</li>
|
||||
<li>按照桶的从小到大的顺序,合并结果。</li>
|
||||
</ol>
|
||||
<p><img alt="桶排序算法流程" src="../bucket_sort.assets/bucket_sort_overview.png" /></p>
|
||||
<p align="center"> Fig. 桶排序算法流程 </p>
|
||||
|
Reference in New Issue
Block a user