mirror of
https://github.com/krahets/hello-algo.git
synced 2026-04-13 18:00:18 +08:00
deploy
This commit is contained in:
@@ -3529,8 +3529,8 @@
|
||||
<h1 id="163">16.3 术语表<a class="headerlink" href="#163" title="Permanent link">¶</a></h1>
|
||||
<p>表 16-1 列出了书中出现的重要术语,值得注意以下几点。</p>
|
||||
<ul>
|
||||
<li>部分名词在简体中文和繁体中文下的叫法不同。</li>
|
||||
<li>建议记住名词的英文叫法,以便阅读英文文献。</li>
|
||||
<li>部分名词在简体中文和繁体中文下的叫法不同。</li>
|
||||
</ul>
|
||||
<p align="center"> 表 16-1 数据结构与算法的重要名词 </p>
|
||||
|
||||
@@ -3547,7 +3547,7 @@
|
||||
<tr>
|
||||
<td>algorithm</td>
|
||||
<td>算法</td>
|
||||
<td>算法</td>
|
||||
<td>演算法</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>data structure</td>
|
||||
@@ -3555,6 +3555,26 @@
|
||||
<td>資料結構</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>code</td>
|
||||
<td>代码</td>
|
||||
<td>程式碼</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>function</td>
|
||||
<td>函数</td>
|
||||
<td>函式</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>method</td>
|
||||
<td>方法</td>
|
||||
<td>方法</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>variable</td>
|
||||
<td>变量</td>
|
||||
<td>變數</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>asymptotic complexity analysis</td>
|
||||
<td>渐近复杂度分析</td>
|
||||
<td>漸近複雜度分析</td>
|
||||
@@ -3570,6 +3590,11 @@
|
||||
<td>空間複雜度</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>loop</td>
|
||||
<td>循环</td>
|
||||
<td>迴圈</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>iteration</td>
|
||||
<td>迭代</td>
|
||||
<td>迭代</td>
|
||||
@@ -3627,12 +3652,12 @@
|
||||
<tr>
|
||||
<td>linked list</td>
|
||||
<td>链表</td>
|
||||
<td>連結串列</td>
|
||||
<td>鏈結串列</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>linked list node, list node</td>
|
||||
<td>链表节点</td>
|
||||
<td>連結串列節點</td>
|
||||
<td>鏈結串列節點</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>head node</td>
|
||||
@@ -3851,7 +3876,7 @@
|
||||
</tr>
|
||||
<tr>
|
||||
<td>AVL tree</td>
|
||||
<td>AVL 树</td>
|
||||
<td>AVL 树</td>
|
||||
<td>AVL 樹</td>
|
||||
</tr>
|
||||
<tr>
|
||||
@@ -3892,17 +3917,17 @@
|
||||
<tr>
|
||||
<td>heap</td>
|
||||
<td>堆</td>
|
||||
<td>堆</td>
|
||||
<td>堆積</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>max heap</td>
|
||||
<td>大顶堆</td>
|
||||
<td>大頂堆</td>
|
||||
<td>大頂堆積</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>min heap</td>
|
||||
<td>小顶堆</td>
|
||||
<td>小頂堆</td>
|
||||
<td>小頂堆積</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>priority queue</td>
|
||||
@@ -3912,12 +3937,12 @@
|
||||
<tr>
|
||||
<td>heapify</td>
|
||||
<td>堆化</td>
|
||||
<td>堆化</td>
|
||||
<td>堆積化</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>top-<span class="arithmatex">\(k\)</span> problem</td>
|
||||
<td>Top-<span class="arithmatex">\(k\)</span> 问题</td>
|
||||
<td>Top-<span class="arithmatex">\(k\)</span> 問題</td>
|
||||
<td>Top-<span class="arithmatex">\(k\)</span> 问题</td>
|
||||
<td>Top-<span class="arithmatex">\(k\)</span> 問題</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>graph</td>
|
||||
@@ -4037,7 +4062,7 @@
|
||||
<tr>
|
||||
<td>heap sort</td>
|
||||
<td>堆排序</td>
|
||||
<td>堆排序</td>
|
||||
<td>堆積排序</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>bucket sort</td>
|
||||
@@ -4062,7 +4087,7 @@
|
||||
<tr>
|
||||
<td>hanota problem</td>
|
||||
<td>汉诺塔问题</td>
|
||||
<td>漢諾塔問題</td>
|
||||
<td>河內塔問題</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>backtracking algorithm</td>
|
||||
@@ -4132,7 +4157,7 @@
|
||||
<tr>
|
||||
<td>greedy algorithm</td>
|
||||
<td>贪心算法</td>
|
||||
<td>貪心演算法</td>
|
||||
<td>貪婪演算法</td>
|
||||
</tr>
|
||||
</tbody>
|
||||
</table>
|
||||
|
||||
Reference in New Issue
Block a user