You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
|
|
---
|
|
|
|
|
comments: true
|
|
|
|
|
icon: material/table-search
|
|
|
|
|
---
|
|
|
|
|
|
|
|
|
|
# Chapter 6. Hash table
|
|
|
|
|
|
|
|
|
|
{ class="cover-image" }
|
|
|
|
|
|
|
|
|
|
!!! abstract
|
|
|
|
|
|
|
|
|
|
In the world of computing, a hash table is akin to an intelligent librarian.
|
|
|
|
|
|
|
|
|
|
It understands how to compute index numbers, enabling swift retrieval of the desired book.
|
|
|
|
|
|
|
|
|
|
## Chapter contents
|
|
|
|
|
|
|
|
|
|
- [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)
|
