Page 110 - Data Structures Handout
P. 110
where is the number of keys stored in the table and is the table size (number of
slots).
• A low load factor means fewer collisions and faster operations.
• A high load factor increases collisions, slowing down performance.
• In practice, hash tables are often resized (rehashing) when the load factor exceeds a
threshold (commonly 0.7 or 0.75).
Example: Calculating Load Factor in C++
This program calculates the load factor after inserting keys. As more keys are added,
110
