This project implements the basic functionality of a hash map (initialization, hash function, insertion, deletion, and retrieval) using lists. It runs in amortized constant time for insertion, ...

The Hashmap was designed this way in order to utilize the chaining method of resolving collisions. When two elements are supposed to be inserted to the same key, instead of having to calculate a new ...