Hash Table (Hash Map)
- is a data structure that implements an associative array (i.e. maps or dictionaries, an abstract data type that can hold data in ⟨key, value⟩ pairs)
- uses a hash function (usually Consistent Hashing) to “hash” the value in order to compute a key (index)to be placed into an associative array
TODO read https://en.wikipedia.org/wiki/Hash_table#Hashing
Fill Factor & Growth Factor
- fill factor - the percentage of capacity representing the maximum number of items before the table will grow (not filled keys/indices but items)
- growth factor - the percentage to increase the capacity when fill factor has been exceeded