C++ Data Structures and Algorithms

Developing a Search() operation

Similar to the preceding Insert() operation, to search for a value of a key, we need to obtain the hash key of that given key using HashFunction(). Then, we check the cell which the index is the hash key. If the key in that cell matches with the given key, we just need to return the value of the key. If not, we have to find another possible slot using the linear probing calculation until the given key is found. If the given key is still not found, just return an empty string to notify the user that the given key doesn't exist in the hash table. The implementation of the Search() function is as follows:

string HashTable::Search(int key){    // Get hash key from hash function    int hashIndex = HashFunction(key);