To solve this problem, we are going to construct a hash table data type. This data type will have a hash function to convert a given big phone number into a small integer value. By using a hash table, we don't need to provide a million memory allocations; instead, we can determine a table size for the hash table. Afterward, we will map the integer value to the index of the hash table.
A phone number usually contains at least six to seven digits; however, for the sake of simplicity, we will use three-digit phone numbers in the example in this section. Here is a list of phone numbers we will use in several examples in upcoming sections:
As we can see in the preceding list, we have 10 phone numbers, and each number is ...
