2024-01-28 22:31:08 +08:00
|
|
|
---
|
|
|
|
|
comments: true
|
|
|
|
|
icon: material/table-search
|
|
|
|
|
---
|
|
|
|
|
|
2024-04-06 03:02:20 +08:00
|
|
|
# Chapter 6. Hash table
|
2024-01-28 22:31:08 +08:00
|
|
|
|
2024-04-06 03:02:20 +08:00
|
|
|
{ class="cover-image" }
|
2024-01-28 22:31:08 +08:00
|
|
|
|
|
|
|
|
!!! abstract
|
|
|
|
|
|
2024-02-08 03:34:44 +08:00
|
|
|
In the world of computing, a hash table is akin to an intelligent librarian.
|
2024-01-28 22:31:08 +08:00
|
|
|
|
2024-02-08 03:34:44 +08:00
|
|
|
It understands how to compute index numbers, enabling swift retrieval of the desired book.
|
2024-01-28 22:31:08 +08:00
|
|
|
|
2024-04-07 02:41:53 +08:00
|
|
|
## Chapter contents
|
2024-01-28 22:31:08 +08:00
|
|
|
|
2024-04-07 02:41:53 +08:00
|
|
|
- [6.1 Hash table](hash_map.md)
|
|
|
|
|
- [6.2 Hash collision](hash_collision.md)
|
|
|
|
|
- [6.3 Hash algorithm](hash_algorithm.md)
|
|
|
|
|
- [6.4 Summary](summary.md)
|
