Hash tables

Implements an unorderd associative array that maps keys to values

It uses a hash function to compute an offset into the array for a given key, from which the desired value can be found

Space complexity: O(n)