Module 7 - Hash Map
1. Main Concept of Hash Map
Hashing is the process of converting data of any size (like a string, number, or object) into a f...
2. Collision Handling
A Collision occurs when two or more different keys produce the same hash value (index). For examp...
3. Load Factor and Rehashing
3.1. Load Factor (λ) The Load Factor (λ) is a measure of how full the hash table is. It is a crit...
4. Example: Full Manual Implementation
This chapter combines all the concepts from Chapters 2 and 3 into a single, complete MyHashMap cl...
5. Hashing Implementation with C++ STL
In C++, instead of creating a Hash Table manually, you could use Standard Template Library (STL)....
6. Custom Struct Keys
A notable limitation of the C++ STL's std::unordered_map and std::unordered_set is their inabilit...