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