Hashing Flashcards
1
Q
Map
A
A map is a data structure that stores entries
2
Q
Key and value
A
Each entry contains two parts: key and value. The key is also
called a search key, which is used to search for the corresponding
value.
3
Q
Hashing
A
Hashing is a technique that retrieves the value using the index
obtained from the key without performing a search.
4
Q
Hash function
A
A typical hash function first converts a search key to an integer value
called a hash code, and then compresses the hash code into an
index to the hash table.
