Hash table
This consists of an associative array
and a hash function . Values provided to the hash table get hashed using which provides a key (usually thought of as a number below a given load value) for . Then the within this entry of you will store some object that can verify if the value is in this table. In an ideal world the hash function would map each key to a different key of however this is unlikely to happen in practice. So hash tables need to handle key collision.