# HashTable

A hash table uses a hash function to map each value to an integer, which is used as array index where the values are stored. The indexed array positions are called slots or buckets. If there are $\Theta(n)$ buckets available, then the worst-case time for insert, find and delete is $\mathcal{O}(1)$.