Hash Tables

Hash tables are a way to store information inside of an array to allow for O(1) lookup speeds. The way that hash tables work is by organizing information (Key:Value pairs) inputted into an array called a Bucket by a Hash.

A hash is a way of determining where a key should be stored in the bucket. Commonly this is achieved by either summing or multiplying the ASCII character codes of the key string and then dividing it by the size of the bucket.

A bucket is an array that contains multiple linked lists. These linked lists will be sets of key value pairs that match up with the hash for that location in the array.