mirror of
https://github.com/krahets/hello-algo.git
synced 2026-07-08 03:56:47 +08:00
143 lines
7.2 KiB
Markdown
143 lines
7.2 KiB
Markdown
---
|
||
comments: true
|
||
---
|
||
|
||
# 16.3 術語表
|
||
|
||
表 16-1 列出了書中出現的重要術語。建議記住各個名詞的英文叫法，以便閱讀英文文獻。
|
||
|
||
<p align="center"> 表 16-1 資料結構與演算法的重要名詞 </p>
|
||
|
||
<div class="center-table" markdown>
|
||
|
||
| English | 繁體中文 |
|
||
| ------------------------------ | -------------- |
|
||
| algorithm | 演算法 |
|
||
| data structure | 資料結構 |
|
||
| code | 程式碼 |
|
||
| file | 檔案 |
|
||
| function | 函式 |
|
||
| method | 方法 |
|
||
| variable | 變數 |
|
||
| asymptotic complexity analysis | 漸近複雜度分析 |
|
||
| time complexity | 時間複雜度 |
|
||
| space complexity | 空間複雜度 |
|
||
| loop | 迴圈 |
|
||
| iteration | 迭代 |
|
||
| recursion | 遞迴 |
|
||
| tail recursion | 尾遞迴 |
|
||
| recursion tree | 遞迴樹 |
|
||
| big-$O$ notation | 大 $O$ 記號 |
|
||
| asymptotic upper bound | 漸近上界 |
|
||
| sign-magnitude | 原碼 |
|
||
| 1’s complement | 一補數 |
|
||
| 2’s complement | 二補數 |
|
||
| array | 陣列 |
|
||
| index | 索引 |
|
||
| linked list | 鏈結串列 |
|
||
| linked list node, list node | 鏈結串列節點 |
|
||
| head node | 頭節點 |
|
||
| tail node | 尾節點 |
|
||
| list | 串列 |
|
||
| dynamic array | 動態陣列 |
|
||
| hard disk | 硬碟 |
|
||
| random-access memory (RAM) | 記憶體 |
|
||
| cache memory | 快取 |
|
||
| cache miss | 快取未命中 |
|
||
| cache hit rate | 快取命中率 |
|
||
| stack | 堆疊 |
|
||
| top of the stack | 堆疊頂 |
|
||
| bottom of the stack | 堆疊底 |
|
||
| queue | 佇列 |
|
||
| double-ended queue | 雙向佇列 |
|
||
| front of the queue | 佇列首 |
|
||
| rear of the queue | 佇列尾 |
|
||
| hash table | 雜湊表 |
|
||
| hash set | 雜湊集合 |
|
||
| bucket | 桶 |
|
||
| hash function | 雜湊函式 |
|
||
| hash collision | 雜湊衝突 |
|
||
| load factor | 負載因子 |
|
||
| separate chaining | 鏈結位址 |
|
||
| open addressing | 開放定址 |
|
||
| linear probing | 線性探查 |
|
||
| lazy deletion | 懶刪除 |
|
||
| binary tree | 二元樹 |
|
||
| tree node | 樹節點 |
|
||
| left-child node | 左子節點 |
|
||
| right-child node | 右子節點 |
|
||
| parent node | 父節點 |
|
||
| left subtree | 左子樹 |
|
||
| right subtree | 右子樹 |
|
||
| root node | 根節點 |
|
||
| leaf node | 葉節點 |
|
||
| edge | 邊 |
|
||
| level | 層 |
|
||
| degree | 度 |
|
||
| height | 高度 |
|
||
| depth | 深度 |
|
||
| perfect binary tree | 完美二元樹 |
|
||
| complete binary tree | 完全二元樹 |
|
||
| full binary tree | 完滿二元樹 |
|
||
| balanced binary tree | 平衡二元樹 |
|
||
| binary search tree | 二元搜尋樹 |
|
||
| AVL tree | AVL 樹 |
|
||
| red-black tree | 紅黑樹 |
|
||
| level-order traversal | 層序走訪 |
|
||
| breadth-first traversal | 廣度優先走訪 |
|
||
| depth-first traversal | 深度優先走訪 |
|
||
| binary search tree | 二元搜尋樹 |
|
||
| balanced binary search tree | 平衡二元搜尋樹 |
|
||
| balance factor | 平衡因子 |
|
||
| heap | 堆積 |
|
||
| max heap | 大頂堆積 |
|
||
| min heap | 小頂堆積 |
|
||
| priority queue | 優先佇列 |
|
||
| heapify | 堆積化 |
|
||
| top-$k$ problem | Top-$k$ 問題 |
|
||
| graph | 圖 |
|
||
| vertex | 頂點 |
|
||
| undirected graph | 無向圖 |
|
||
| directed graph | 有向圖 |
|
||
| connected graph | 連通圖 |
|
||
| disconnected graph | 非連通圖 |
|
||
| weighted graph | 有權圖 |
|
||
| adjacency | 鄰接 |
|
||
| path | 路徑 |
|
||
| in-degree | 入度 |
|
||
| out-degree | 出度 |
|
||
| adjacency matrix | 鄰接矩陣 |
|
||
| adjacency list | 鄰接表 |
|
||
| breadth-first search | 廣度優先搜尋 |
|
||
| depth-first search | 深度優先搜尋 |
|
||
| binary search | 二分搜尋 |
|
||
| searching algorithm | 搜尋演算法 |
|
||
| sorting algorithm | 排序演算法 |
|
||
| selection sort | 選擇排序 |
|
||
| bubble sort | 泡沫排序 |
|
||
| insertion sort | 插入排序 |
|
||
| quick sort | 快速排序 |
|
||
| merge sort | 合併排序 |
|
||
| heap sort | 堆積排序 |
|
||
| bucket sort | 桶排序 |
|
||
| counting sort | 計數排序 |
|
||
| radix sort | 基數排序 |
|
||
| divide and conquer | 分治 |
|
||
| hanota problem | 河內塔問題 |
|
||
| backtracking algorithm | 回溯演算法 |
|
||
| constraint | 約束 |
|
||
| solution | 解 |
|
||
| state | 狀態 |
|
||
| pruning | 剪枝 |
|
||
| permutations problem | 全排列問題 |
|
||
| subset-sum problem | 子集合問題 |
|
||
| $n$-queens problem | $n$ 皇后問題 |
|
||
| dynamic programming | 動態規劃 |
|
||
| initial state | 初始狀態 |
|
||
| state-transition equation | 狀態轉移方程 |
|
||
| knapsack problem | 背包問題 |
|
||
| edit distance problem | 編輯距離問題 |
|
||
| greedy algorithm | 貪婪演算法 |
|
||
|
||
</div>
|