The Hash Function
This is the first building block of a hash table. Let's see how it works.
We'll cover the following...
Restricting the Key Size
A key is used to map a value in the array, and the efficiency of a hash table depends on how a key is computed. At first glance, you may observe that we can directly use the indices as keys because each index is unique.
One Problem
The only problem is that the key would eventually exceed the size of the array and at every insertion, the array would need to be resized. Syntactically, we can easily increase array size in JavaScript, but as we learned before, the process still takes O(n) time at the back end.
One Solution
In order to limit the range of the keys to the boundaries of the array, we need a function that converts a large key into a smaller key. This is the job of the hash function.
A hash function simply takes an item’s key and returns the corresponding index in the array for that item. Depending on your program, the calculation of this index can be a simple arithmetic or a very complicated encryption method. However, it is important to choose an efficient hashing function as it directly affects the performance of the hash table mechanism.
Common Hash Functions
Let’s have a look at some of the most common hash functions used in modern programming.
Arithmetic Modular
In this approach, we take the modular of the key with the array size:
...