A hash table, aka hash map, is a data structure that implements an associative array or dictionary. It is an abstract data type that maps keys to values
Ideally, the hash function will assign each key to a unique bucket, but most hash tables designs employ an imperfect hash function, which might cause hash collisions where the hash function generates the same index for more than one key. Such collisions are typically accomodated in some way
Since we are using a size 13 hash table, the hash function we will be using is:
\(h(k)=k\mod m\)
Where \(k=key\) and \(m=sizeOfTable\)
Time complexity of a hash table:
Average of \(\Theta(1)\); worst case of \(O(n)\)