Hash table - liz-kavalski-401-advanced-javascript/seattle-javascript-401n13 GitHub Wiki
Hash is the result of some algorithm taking an incoming string and converting it into a value that could be used for either security or some other purpose.
In the case of a hash table, it is used to determine the index of the array.
Buckets is what is contained in each index of the array of the hash table.
Each indicie is a bucket. An indicie could potentially contain multiple key/value pairs if a collision occurs.
Collisions is what happens when more than one key gets hashed to the same location of the hash table.
Use key values pairs
The hash function takes a key and returns an integer.
Use the integer to determine where the key/value pair should be placed in the array.
Recognize: calculating load factors and choosing the optimal number of buckets, and determining the best hash functions is not within the scope of this class.