deploy

chapter_appendix/terminology/index.html

@@ -4341,11 +4341,7 @@
 
 <!-- Page content -->
 <h1 id="163">16.3 &nbsp; 术语表<a class="headerlink" href="#163" title="Permanent link">&para;</a></h1>
-<p>表 16-1 列出了书中出现的重要术语，值得注意以下几点。</p>
-<ul>
-<li>建议记住名词的英文叫法，以便阅读英文文献。</li>
-<li>部分名词在简体中文和繁体中文下的叫法不同。</li>
-</ul>
+<p>表 16-1 列出了书中出现的重要术语。建议记住各个名词的英文叫法，以便阅读英文文献。</p>
 <p align="center"> 表 16-1 &nbsp; 数据结构与算法的重要名词 </p>
 
 <div class="center-table">
@@ -4354,639 +4350,512 @@
 <tr>
 <th>English</th>
 <th>简体中文</th>
-<th>繁体中文</th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td>algorithm</td>
 <td>算法</td>
-<td>演算法</td>
 </tr>
 <tr>
 <td>data structure</td>
 <td>数据结构</td>
-<td>資料結構</td>
 </tr>
 <tr>
 <td>code</td>
 <td>代码</td>
-<td>程式碼</td>
 </tr>
 <tr>
 <td>file</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>
 </tr>
 <tr>
 <td>time complexity</td>
 <td>时间复杂度</td>
-<td>時間複雜度</td>
 </tr>
 <tr>
 <td>space complexity</td>
 <td>空间复杂度</td>
-<td>空間複雜度</td>
 </tr>
 <tr>
 <td>loop</td>
 <td>循环</td>
-<td>迴圈</td>
 </tr>
 <tr>
 <td>iteration</td>
 <td>迭代</td>
-<td>迭代</td>
 </tr>
 <tr>
 <td>recursion</td>
 <td>递归</td>
-<td>遞迴</td>
 </tr>
 <tr>
 <td>tail recursion</td>
 <td>尾递归</td>
-<td>尾遞迴</td>
 </tr>
 <tr>
 <td>recursion tree</td>
 <td>递归树</td>
-<td>遞迴樹</td>
 </tr>
 <tr>
 <td>big-<span class="arithmatex">\(O\)</span> notation</td>
 <td>大 <span class="arithmatex">\(O\)</span> 记号</td>
-<td>大 <span class="arithmatex">\(O\)</span> 記號</td>
 </tr>
 <tr>
 <td>asymptotic upper bound</td>
 <td>渐近上界</td>
-<td>漸近上界</td>
 </tr>
 <tr>
 <td>sign-magnitude</td>
 <td>原码</td>
-<td>原碼</td>
 </tr>
 <tr>
 <td>1’s complement</td>
 <td>反码</td>
-<td>一補數</td>
 </tr>
 <tr>
 <td>2’s complement</td>
 <td>补码</td>
-<td>二補數</td>
 </tr>
 <tr>
 <td>array</td>
 <td>数组</td>
-<td>陣列</td>
 </tr>
 <tr>
 <td>index</td>
 <td>索引</td>
-<td>索引</td>
 </tr>
 <tr>
 <td>linked list</td>
 <td>链表</td>
-<td>鏈結串列</td>
 </tr>
 <tr>
 <td>linked list node, list node</td>
 <td>链表节点</td>
-<td>鏈結串列節點</td>
 </tr>
 <tr>
 <td>head node</td>
 <td>头节点</td>
-<td>頭節點</td>
 </tr>
 <tr>
 <td>tail node</td>
 <td>尾节点</td>
-<td>尾節點</td>
 </tr>
 <tr>
 <td>list</td>
 <td>列表</td>
-<td>串列</td>
 </tr>
 <tr>
 <td>dynamic array</td>
 <td>动态数组</td>
-<td>動態陣列</td>
 </tr>
 <tr>
 <td>hard disk</td>
 <td>硬盘</td>
-<td>硬碟</td>
 </tr>
 <tr>
 <td>random-access memory (RAM)</td>
 <td>内存</td>
-<td>記憶體</td>
 </tr>
 <tr>
 <td>cache memory</td>
 <td>缓存</td>
-<td>快取</td>
 </tr>
 <tr>
 <td>cache miss</td>
 <td>缓存未命中</td>
-<td>快取未命中</td>
 </tr>
 <tr>
 <td>cache hit rate</td>
 <td>缓存命中率</td>
-<td>快取命中率</td>
 </tr>
 <tr>
 <td>stack</td>
 <td>栈</td>
-<td>堆疊</td>
 </tr>
 <tr>
 <td>top of the stack</td>
 <td>栈顶</td>
-<td>堆疊頂</td>
 </tr>
 <tr>
 <td>bottom of the stack</td>
 <td>栈底</td>
-<td>堆疊底</td>
 </tr>
 <tr>
 <td>queue</td>
 <td>队列</td>
-<td>佇列</td>
 </tr>
 <tr>
 <td>double-ended queue</td>
 <td>双向队列</td>
-<td>雙向佇列</td>
 </tr>
 <tr>
 <td>front of the queue</td>
 <td>队首</td>
-<td>佇列首</td>
 </tr>
 <tr>
 <td>rear of the queue</td>
 <td>队尾</td>
-<td>佇列尾</td>
 </tr>
 <tr>
 <td>hash table</td>
 <td>哈希表</td>
-<td>雜湊表</td>
 </tr>
 <tr>
 <td>hash set</td>
 <td>哈希集合</td>
-<td>雜湊集合</td>
 </tr>
 <tr>
 <td>bucket</td>
 <td>桶</td>
-<td>桶</td>
 </tr>
 <tr>
 <td>hash function</td>
 <td>哈希函数</td>
-<td>雜湊函式</td>
 </tr>
 <tr>
 <td>hash collision</td>
 <td>哈希冲突</td>
-<td>雜湊衝突</td>
 </tr>
 <tr>
 <td>load factor</td>
 <td>负载因子</td>
-<td>負載因子</td>
 </tr>
 <tr>
 <td>separate chaining</td>
 <td>链式地址</td>
-<td>鏈結位址</td>
 </tr>
 <tr>
 <td>open addressing</td>
 <td>开放寻址</td>
-<td>開放定址</td>
 </tr>
 <tr>
 <td>linear probing</td>
 <td>线性探测</td>
-<td>線性探查</td>
 </tr>
 <tr>
 <td>lazy deletion</td>
 <td>懒删除</td>
-<td>懶刪除</td>
 </tr>
 <tr>
 <td>binary tree</td>
 <td>二叉树</td>
-<td>二元樹</td>
 </tr>
 <tr>
 <td>tree node</td>
 <td>树节点</td>
-<td>樹節點</td>
 </tr>
 <tr>
 <td>left-child node</td>
 <td>左子节点</td>
-<td>左子節點</td>
 </tr>
 <tr>
 <td>right-child node</td>
 <td>右子节点</td>
-<td>右子節點</td>
 </tr>
 <tr>
 <td>parent node</td>
 <td>父节点</td>
-<td>父節點</td>
 </tr>
 <tr>
 <td>left subtree</td>
 <td>左子树</td>
-<td>左子樹</td>
 </tr>
 <tr>
 <td>right subtree</td>
 <td>右子树</td>
-<td>右子樹</td>
 </tr>
 <tr>
 <td>root node</td>
 <td>根节点</td>
-<td>根節點</td>
 </tr>
 <tr>
 <td>leaf node</td>
 <td>叶节点</td>
-<td>葉節點</td>
 </tr>
 <tr>
 <td>edge</td>
 <td>边</td>
-<td>邊</td>
 </tr>
 <tr>
 <td>level</td>
 <td>层</td>
-<td>層</td>
 </tr>
 <tr>
 <td>degree</td>
 <td>度</td>
-<td>度</td>
 </tr>
 <tr>
 <td>height</td>
 <td>高度</td>
-<td>高度</td>
 </tr>
 <tr>
 <td>depth</td>
 <td>深度</td>
-<td>深度</td>
 </tr>
 <tr>
 <td>perfect binary tree</td>
 <td>完美二叉树</td>
-<td>完美二元樹</td>
 </tr>
 <tr>
 <td>complete binary tree</td>
 <td>完全二叉树</td>
-<td>完全二元樹</td>
 </tr>
 <tr>
 <td>full binary tree</td>
 <td>完满二叉树</td>
-<td>完滿二元樹</td>
 </tr>
 <tr>
 <td>balanced binary tree</td>
 <td>平衡二叉树</td>
-<td>平衡二元樹</td>
 </tr>
 <tr>
 <td>binary search tree</td>
 <td>二叉搜索树</td>
-<td>二元搜尋樹</td>
 </tr>
 <tr>
 <td>AVL tree</td>
 <td>AVL 树</td>
-<td>AVL 樹</td>
 </tr>
 <tr>
 <td>red-black tree</td>
 <td>红黑树</td>
-<td>紅黑樹</td>
 </tr>
 <tr>
 <td>level-order traversal</td>
 <td>层序遍历</td>
-<td>層序走訪</td>
 </tr>
 <tr>
 <td>breadth-first traversal</td>
 <td>广度优先遍历</td>
-<td>廣度優先走訪</td>
 </tr>
 <tr>
 <td>depth-first traversal</td>
 <td>深度优先遍历</td>
-<td>深度優先走訪</td>
 </tr>
 <tr>
 <td>binary search tree</td>
 <td>二叉搜索树</td>
-<td>二元搜尋樹</td>
 </tr>
 <tr>
 <td>balanced binary search tree</td>
 <td>平衡二叉搜索树</td>
-<td>平衡二元搜尋樹</td>
 </tr>
 <tr>
 <td>balance factor</td>
 <td>平衡因子</td>
-<td>平衡因子</td>
 </tr>
 <tr>
 <td>heap</td>
 <td>堆</td>
-<td>堆積</td>
 </tr>
 <tr>
 <td>max heap</td>
 <td>大顶堆</td>
-<td>大頂堆積</td>
 </tr>
 <tr>
 <td>min heap</td>
 <td>小顶堆</td>
-<td>小頂堆積</td>
 </tr>
 <tr>
 <td>priority queue</td>
 <td>优先队列</td>
-<td>優先佇列</td>
 </tr>
 <tr>
 <td>heapify</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>
 </tr>
 <tr>
 <td>graph</td>
 <td>图</td>
-<td>圖</td>
 </tr>
 <tr>
 <td>vertex</td>
 <td>顶点</td>
-<td>頂點</td>
 </tr>
 <tr>
 <td>undirected graph</td>
 <td>无向图</td>
-<td>無向圖</td>
 </tr>
 <tr>
 <td>directed graph</td>
 <td>有向图</td>
-<td>有向圖</td>
 </tr>
 <tr>
 <td>connected graph</td>
 <td>连通图</td>
-<td>連通圖</td>
 </tr>
 <tr>
 <td>disconnected graph</td>
 <td>非连通图</td>
-<td>非連通圖</td>
 </tr>
 <tr>
 <td>weighted graph</td>
 <td>有权图</td>
-<td>有權圖</td>
 </tr>
 <tr>
 <td>adjacency</td>
 <td>邻接</td>
-<td>鄰接</td>
 </tr>
 <tr>
 <td>path</td>
 <td>路径</td>
-<td>路徑</td>
 </tr>
 <tr>
 <td>in-degree</td>
 <td>入度</td>
-<td>入度</td>
 </tr>
 <tr>
 <td>out-degree</td>
 <td>出度</td>
-<td>出度</td>
 </tr>
 <tr>
 <td>adjacency matrix</td>
 <td>邻接矩阵</td>
-<td>鄰接矩陣</td>
 </tr>
 <tr>
 <td>adjacency list</td>
 <td>邻接表</td>
-<td>鄰接表</td>
 </tr>
 <tr>
 <td>breadth-first search</td>
 <td>广度优先搜索</td>
-<td>廣度優先搜尋</td>
 </tr>
 <tr>
 <td>depth-first search</td>
 <td>深度优先搜索</td>
-<td>深度優先搜尋</td>
 </tr>
 <tr>
 <td>binary search</td>
 <td>二分查找</td>
-<td>二分搜尋</td>
 </tr>
 <tr>
 <td>searching algorithm</td>
 <td>搜索算法</td>
-<td>搜尋演算法</td>
 </tr>
 <tr>
 <td>sorting algorithm</td>
 <td>排序算法</td>
-<td>排序演算法</td>
 </tr>
 <tr>
 <td>selection sort</td>
 <td>选择排序</td>
-<td>選擇排序</td>
 </tr>
 <tr>
 <td>bubble sort</td>
 <td>冒泡排序</td>
-<td>泡沫排序</td>
 </tr>
 <tr>
 <td>insertion sort</td>
 <td>插入排序</td>
-<td>插入排序</td>
 </tr>
 <tr>
 <td>quick sort</td>
 <td>快速排序</td>
-<td>快速排序</td>
 </tr>
 <tr>
 <td>merge sort</td>
 <td>归并排序</td>
-<td>合併排序</td>
 </tr>
 <tr>
 <td>heap sort</td>
 <td>堆排序</td>
-<td>堆積排序</td>
 </tr>
 <tr>
 <td>bucket sort</td>
 <td>桶排序</td>
-<td>桶排序</td>
 </tr>
 <tr>
 <td>counting sort</td>
 <td>计数排序</td>
-<td>計數排序</td>
 </tr>
 <tr>
 <td>radix sort</td>
 <td>基数排序</td>
-<td>基數排序</td>
 </tr>
 <tr>
 <td>divide and conquer</td>
 <td>分治</td>
-<td>分治</td>
 </tr>
 <tr>
 <td>hanota problem</td>
 <td>汉诺塔问题</td>
-<td>河內塔問題</td>
 </tr>
 <tr>
 <td>backtracking algorithm</td>
 <td>回溯算法</td>
-<td>回溯演算法</td>
 </tr>
 <tr>
 <td>constraint</td>
 <td>约束</td>
-<td>約束</td>
 </tr>
 <tr>
 <td>solution</td>
 <td>解</td>
-<td>解</td>
 </tr>
 <tr>
 <td>state</td>
 <td>状态</td>
-<td>狀態</td>
 </tr>
 <tr>
 <td>pruning</td>
 <td>剪枝</td>
-<td>剪枝</td>
 </tr>
 <tr>
 <td>permutations problem</td>
 <td>全排列问题</td>
-<td>全排列問題</td>
 </tr>
 <tr>
 <td>subset-sum problem</td>
 <td>子集和问题</td>
-<td>子集合問題</td>
 </tr>
 <tr>
 <td><span class="arithmatex">\(n\)</span>-queens problem</td>
 <td><span class="arithmatex">\(n\)</span> 皇后问题</td>
-<td><span class="arithmatex">\(n\)</span> 皇后問題</td>
 </tr>
 <tr>
 <td>dynamic programming</td>
 <td>动态规划</td>
-<td>動態規劃</td>
 </tr>
 <tr>
 <td>initial state</td>
 <td>初始状态</td>
-<td>初始狀態</td>
 </tr>
 <tr>
 <td>state-transition equation</td>
 <td>状态转移方程</td>
-<td>狀態轉移方程</td>
 </tr>
 <tr>
 <td>knapsack problem</td>
 <td>背包问题</td>
-<td>背包問題</td>
 </tr>
 <tr>
 <td>edit distance problem</td>
 <td>编辑距离问题</td>
-<td>編輯距離問題</td>
 </tr>
 <tr>
 <td>greedy algorithm</td>
 <td>贪心算法</td>
-<td>貪婪演算法</td>
 </tr>
 </tbody>
 </table>