In the last session, we implemented a Hash Table, the backbone of which is the hash function.
An ideal hash function gives a unique location for each key. However, since the number of possible keys is much larger than the number of locations, some keys will inevitably hash to the same index location. When this happens, it is called a hash collision.
For this exercise, we will attempt collision resolution using Open Addressing. Refer to your notes if you would like to learn about the other collision resolution strategy, using Closed Addressing.
Some of the open addressing strategies include: