algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-19 07:17:54 +08:00
Code Issues Packages Projects Releases Wiki Activity

Polish the chapter of searching and sorting.

Browse Source
This commit is contained in:
krahets
2023-04-10 03:11:49 +08:00
parent 0bec52d7cc
commit 9a74d9a9d1
24 changed files with 199 additions and 217 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
docs/chapter_hashing/hash_map.md
View File

@@ -15,7 +15,7 @@
3. **链表**：每个节点的值为 `[学号, 姓名]` ；
4. **二叉搜索树**：每个节点的值为 `[学号, 姓名]` ，根据学号大小来构建树；
各项操作的时间复杂度如下表所示（详解可见[二叉搜索树章节](https://www.hello-algo.com/chapter_tree/binary_search_tree/)）。无论是查找元素还是增删元素，哈希表的时间复杂度都是 $O(1)$，全面胜出！
各项操作的时间复杂度如下表所示（详解可见[二叉搜索树章节](https://www.hello-algo.com/chapter_tree/binary_search_tree/)）。无论是查找元素还是增删元素，哈希表的时间复杂度都是 $O(1)$ ，全面胜出！
<div class="center-table" markdown>