algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-31 22:33:10 +08:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2023-12-02 06:24:11 +08:00
parent 5783c402bf
commit d20d8b3ee1
107 changed files with 1685 additions and 1745 deletions
Download Patch File Download Diff File Expand all files Collapse all files

340
chapter_appendix/terminology/index.html
View File

@ -3317,7 +3317,7 @@
<!-- Page content -->
<h1 id="163">16.3 &nbsp; 术语表<a class="headerlink" href="#163" title="Permanent link">&para;</a></h1>
<p>表 16-1 列出了书中出现的重要术语。建议你同时记住它们的中英文叫法，以便阅读英文文献。</p>
<p align="center"> 表 16-1 &nbsp; 数据结构与算法重要名词 </p>
<p align="center"> 表 16-1 &nbsp; 数据结构与算法的重要名词 </p>
<div class="center-table">
<table>
@ -3325,433 +3325,359 @@
<tr>
<th>中文</th>
<th>English</th>
<th>中文</th>
<th>English</th>
</tr>
</thead>
<tbody>
<tr>
<td>算法</td>
<td>algorithm</td>
</tr>
<tr>
<td>数据结构</td>
<td>data structure</td>
</tr>
<tr>
<td>渐近复杂度分析</td>
<td>asymptotic complexity analysis</td>
</tr>
<tr>
<td>时间复杂度</td>
<td>time complexity</td>
</tr>
<tr>
<td>空间复杂度</td>
<td>space complexity</td>
</tr>
<tr>
<td>迭代</td>
<td>iteration</td>
</tr>
<tr>
<td>递归</td>
<td>recursion</td>
</tr>
<tr>
<td>尾递归</td>
<td>tail recursion</td>
</tr>
<tr>
<td>递归树</td>
<td>recursion tree</td>
</tr>
<tr>
<td>大 <span class="arithmatex">\(O\)</span> 记号</td>
<td>big-<span class="arithmatex">\(O\)</span> notation</td>
</tr>
<tr>
<td>渐近上界</td>
<td>asymptotic upper bound</td>
</tr>
<tr>
<td>原码</td>
<td>sign–magnitude</td>
</tr>
<tr>
<td>反码</td>
<td>1's complement</td>
</tr>
<tr>
<td>补码</td>
<td>2's complement</td>
</tr>
<tr>
<td>数组</td>
<td>array</td>
</tr>
<tr>
<td>索引</td>
<td>index</td>
</tr>
<tr>
<td>链表</td>
<td>linked list</td>
</tr>
<tr>
<td>链表节点</td>
<td>linked list node, list node</td>
</tr>
<tr>
<td>列表</td>
<td>list</td>
</tr>
<tr>
<td>动态数组</td>
<td>dynamic array</td>
</tr>
<tr>
<td>栈</td>
<td>stack</td>
</tr>
<tr>
<td>队列</td>
<td>queue</td>
</tr>
<tr>
<td>双向队列</td>
<td>double-ended queue</td>
</tr>
<tr>
<td>哈希表</td>
<td>hash table</td>
</tr>
<tr>
<td>桶</td>
<td>bucket</td>
</tr>
<tr>
<td>哈希函数</td>
<td>hash function</td>
</tr>
<tr>
<td>哈希冲突</td>
<td>hash collision</td>
</tr>
<tr>
<td>负载因子</td>
<td>load factor</td>
</tr>
<tr>
<td>链式地址</td>
<td>separate chaining</td>
</tr>
<tr>
<td>开放寻址</td>
<td>open addressing</td>
</tr>
<tr>
<td>线性探测</td>
<td>linear probing</td>
</tr>
<tr>
<td>懒删除</td>
<td>lazy deletion</td>
</tr>
<tr>
<td>二叉树</td>
<td>binary tree</td>
</tr>
<tr>
<td>树节点</td>
<td>tree node</td>
</tr>
<tr>
<td>左子节点</td>
<td>left-child node</td>
</tr>
<tr>
<td>右子节点</td>
<td>right-child node</td>
</tr>
<tr>
<td>父节点</td>
<td>parent node</td>
</tr>
<tr>
<td>左子树</td>
<td>left subtree</td>
</tr>
<tr>
<td>右子树</td>
<td>right subtree</td>
</tr>
<tr>
<td>根节点</td>
<td>root node</td>
</tr>
<tr>
<td>叶节点</td>
<td>leaf node</td>
</tr>
<tr>
<td>边</td>
<td>edge</td>
</tr>
<tr>
<td>层</td>
<td>level</td>
</tr>
<tr>
<td>度</td>
<td>degree</td>
</tr>
<tr>
<td>高度</td>
<td>height</td>
</tr>
<tr>
<td>深度</td>
<td>depth</td>
</tr>
<tr>
<td>完美二叉树</td>
<td>perfect binary tree</td>
</tr>
<tr>
<td>完全二叉树</td>
<td>complete binary tree</td>
</tr>
<tr>
<td>完满二叉树</td>
<td>full binary tree</td>
</tr>
<tr>
<td>平衡二叉树</td>
<td>balanced binary tree</td>
</tr>
<tr>
<td>AVL 树</td>
<td>AVL tree</td>
</tr>
<tr>
<td>红黑树</td>
<td>red-black tree</td>
</tr>
<tr>
<td>层序遍历</td>
<td>level-order traversal</td>
</tr>
<tr>
<td>数据结构</td>
<td>data structure</td>
<td>广度优先遍历</td>
<td>breadth-first traversal</td>
</tr>
<tr>
<td>渐近复杂度分析</td>
<td>asymptotic complexity analysis</td>
<td>深度优先遍历</td>
<td>depth-first traversal</td>
</tr>
<tr>
<td>时间复杂度</td>
<td>time complexity</td>
<td>二叉搜索树</td>
<td>binary search tree</td>
</tr>
<tr>
<td>空间复杂度</td>
<td>space complexity</td>
<td>平衡二叉搜索树</td>
<td>balanced binary search tree</td>
</tr>
<tr>
<td>迭代</td>
<td>iteration</td>
<td>平衡因子</td>
<td>balance factor</td>
</tr>
<tr>
<td>递归</td>
<td>recursion</td>
<td>堆</td>
<td>heap</td>
</tr>
<tr>
<td>尾递归</td>
<td>tail recursion</td>
<td>大顶堆</td>
<td>max heap</td>
</tr>
<tr>
<td>递归树</td>
<td>recursion tree</td>
<td>小顶堆</td>
<td>min heap</td>
</tr>
<tr>
<td>大</td>
<td>big-</td>
<td>优先队列</td>
<td>priority queue</td>
</tr>
<tr>
<td>记号</td>
<td>notation</td>
<td></td>
<td></td>
</tr>
<tr>
<td>渐近上界</td>
<td>asymptotic upper bound</td>
<td>堆化</td>
<td>heapify</td>
</tr>
<tr>
<td>原码</td>
<td>sign–magnitude</td>
<td>图</td>
<td>graph</td>
</tr>
<tr>
<td>反码</td>
<td>1’s complement</td>
<td>顶点</td>
<td>vertex</td>
</tr>
<tr>
<td>补码</td>
<td>2’s complement</td>
<td>无向图</td>
<td>undirected graph</td>
</tr>
<tr>
<td>数组</td>
<td>array</td>
<td>有向图</td>
<td>directed graph</td>
</tr>
<tr>
<td>索引</td>
<td>index</td>
<td>连通图</td>
<td>connected graph</td>
</tr>
<tr>
<td>链表</td>
<td>linked list</td>
<td>非连通图</td>
<td>disconnected graph</td>
</tr>
<tr>
<td>链表节点</td>
<td>linked list node, list node</td>
<td>有权图</td>
<td>weighted graph</td>
</tr>
<tr>
<td>列表</td>
<td>list</td>
<td>邻接</td>
<td>adjacency</td>
</tr>
<tr>
<td>动态数组</td>
<td>dynamic array</td>
<td>路径</td>
<td>path</td>
</tr>
<tr>
<td>硬盘</td>
<td>hard disk</td>
<td>入度</td>
<td>in-degree</td>
</tr>
<tr>
<td>内存</td>
<td>random-access memory (RAM)</td>
<td>出度</td>
<td>out-degree</td>
</tr>
<tr>
<td>缓存</td>
<td>cache memory</td>
<td>邻接矩阵</td>
<td>adjacency matrix</td>
</tr>
<tr>
<td>缓存未命中</td>
<td>cache miss</td>
<td>邻接表</td>
<td>adjacency list</td>
</tr>
<tr>
<td>缓存命中率</td>
<td>cache hit rate</td>
<td>广度优先搜索</td>
<td>breadth-first search</td>
</tr>
<tr>
<td>栈</td>
<td>stack</td>
<td>深度优先搜索</td>
<td>depth-first search</td>
</tr>
<tr>
<td>队列</td>
<td>queue</td>
<td>二分查找</td>
<td>binary search</td>
</tr>
<tr>
<td>双向队列</td>
<td>double-ended queue</td>
<td>搜索算法</td>
<td>searching algorithm</td>
</tr>
<tr>
<td>哈希表</td>
<td>hash table</td>
<td>排序算法</td>
<td>sorting algorithm</td>
</tr>
<tr>
<td>桶</td>
<td>bucket</td>
<td>选择排序</td>
<td>selection sort</td>
</tr>
<tr>
<td>哈希函数</td>
<td>hash function</td>
<td>冒泡排序</td>
<td>bubble sort</td>
</tr>
<tr>
<td>哈希冲突</td>
<td>hash collision</td>
<td>插入排序</td>
<td>insertion sort</td>
</tr>
<tr>
<td>负载因子</td>
<td>load factor</td>
<td>快速排序</td>
<td>quick sort</td>
</tr>
<tr>
<td>链式地址</td>
<td>separate chaining</td>
<td>归并排序</td>
<td>merge sort</td>
</tr>
<tr>
<td>开放寻址</td>
<td>open addressing</td>
<td>堆排序</td>
<td>heap sort</td>
</tr>
<tr>
<td>线性探测</td>
<td>linear probing</td>
<td>桶排序</td>
<td>bucket sort</td>
</tr>
<tr>
<td>懒删除</td>
<td>lazy deletion</td>
<td>计数排序</td>
<td>counting sort</td>
</tr>
<tr>
<td>二叉树</td>
<td>binary tree</td>
<td>基数排序</td>
<td>radix sort</td>
</tr>
<tr>
<td>树节点</td>
<td>tree node</td>
<td>分治</td>
<td>divide and conquer</td>
</tr>
<tr>
<td>左子节点</td>
<td>left-child node</td>
<td>汉诺塔问题</td>
<td>hanota problem</td>
</tr>
<tr>
<td>右子节点</td>
<td>right-child node</td>
<td>回溯算法</td>
<td>backtracking algorithm</td>
</tr>
<tr>
<td>父节点</td>
<td>parent node</td>
<td>约束</td>
<td>constraint</td>
</tr>
<tr>
<td>左子树</td>
<td>left subtree</td>
<td>解</td>
<td>solution</td>
</tr>
<tr>
<td>右子树</td>
<td>right subtree</td>
<td>状态</td>
<td>state</td>
</tr>
<tr>
<td>根节点</td>
<td>root node</td>
<td>剪枝</td>
<td>pruning</td>
</tr>
<tr>
<td>叶节点</td>
<td>leaf node</td>
<td>全排列问题</td>
<td>permutations problem</td>
</tr>
<tr>
<td>边</td>
<td>edge</td>
<td>子集和问题</td>
<td>subset-sum problem</td>
</tr>
<tr>
<td>层</td>
<td>level</td>
<td>N 皇后问题</td>
<td>N-queens problem</td>
</tr>
<tr>
<td>度</td>
<td>degree</td>
<td>动态规划</td>
<td>dynamic programming</td>
</tr>
<tr>
<td>高度</td>
<td>height</td>
<td>初始状态</td>
<td>initial state</td>
</tr>
<tr>
<td>深度</td>
<td>depth</td>
<td>状态转移方程</td>
<td>state-trasition equation</td>
</tr>
<tr>
<td>完美二叉树</td>
<td>perfect binary tree</td>
<td>背包问题</td>
<td>knapsack problem</td>
</tr>
<tr>
<td>完全二叉树</td>
<td>complete binary tree</td>
<td>编辑距离问题</td>
<td>edit distance problem</td>
</tr>
<tr>
<td>完满二叉树</td>
<td>full binary tree</td>
<td>贪心算法</td>
<td>greedy algorithm</td>
</tr>
<tr>
<td>平衡二叉树</td>
<td>balanced binary tree</td>
<td></td>
<td></td>
</tr>
<tr>
<td>AVL 树</td>
<td>AVL tree</td>
<td></td>
<td></td>
</tr>
<tr>
<td>红黑树</td>
<td>red-black tree</td>
<td></td>
<td></td>
</tr>
</tbody>
</table>
</div>