Project focused on implementing a hash table with open addressing and comparing different hash functions.
-
Custom hash table implementation (linear probing)
-
Three hashing methods:
- Division method
- Mid-square method
- Multiplication method
-
Performance benchmarking (insert / remove)
-
Analysis for different input scenarios (random, sequential, clustered)
The multiplication method achieved the most stable and efficient performance, while the division method was fastest but more sensitive to collisions.
- C++
<chrono>for benchmarking