Day-10 Flashcards
1
Q
HashTable
A
A hash table is a data structure that can map keys to values. Think of a dictionary.
On average, hash tables have an O(1) constant time look up.
The hash table traverses through the linked list of buckets at that index of its backing array, and returns the value if it finds a bucket with the given key.
If you have no collisions, this is constant time, if you have collisions its linear time.
