Beginning Java Data Structures and Algorithms

Carrying out the Linear Probing Search Operation

The aim here is to develop pseudocode for the search operation in linear probing.

Perform the following steps:

1. Write pseudocode similar to Snippet 3.3 to show the search operation. The operation should return null if the key is not found in the hash table. The search function should have a signature as follows:

 search(key, array)  

2. The pseudocode can be developed as follows:

search(key, array)s = length(array)hashValue = hash(key, s)i = 0while (i < s and array[(hashValue + i) mod s] != null  and array[(hashValue + i) mod s].key != key)  i = i + 1keyValue = array[(hashValue + i) mod s]if (keyValue != null && keyValue.key == key) 

  return keyValue.valueelse return null 

Snippet 3.4: Solution ...