A Common-Sense Guide to Data Structures and Algorithms in JavaScript, Volume 1

Making an Efficient Hash Table

Ultimately, a hash table’s efficiency depends on three factors:

• How much data we’re storing in the hash table
• How many cells are available in the hash table
• Which hash function we’re using

It makes sense why the first two factors are important. If you have a lot of data and only a few cells, there will be many collisions and the hash table will lose its efficiency. Let’s explore, however, why the hash function itself is important for efficiency.

Let’s say we’re using a hash function that always produces a value that falls in the range from 1 to 9. An example of this is a hash function that converts letters into their corresponding numbers and keeps adding the resulting digits together until it ends up with a single ...