Exam 10: Sets and Maps

The goal of the hash table is to access an entry based on its __________ value, not its location.

__________ hashing grows linked lists to store key values associated with a particular index.

Using a hash table enables us to retrieve an item in __________.

Searching for a particular value in a sequential container is generally an O(__________) process.

Because the map class overloads the subscript operator such that the key is used as an index, a map is also known as a(n) __________ array.