Question

(JAVA) Develop pseudocode for the search operation in linear probing.

Write pseudocode similar to Snippet 3.3, included below, 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)

Code Snippet 3.3

insert(key, value, array)
    s = length(array)
    hashValue = hash(key, s)
    i = 0
    while (i < s and array[(hashValue + i) mod s] != null)
        i = i + 1
    if (i < s) array[(hashValue + i) mod s] = (key, value)

Answer 1

search(key, array)

s=length(array)

hashValue = hash(key, s) //find location

if array[hashvalue] == key] //check key at location

print("key is present at hashValue")

else

temp= hashValue

flag=0

while(temp!=hashValue-1)

temp=(temp+1) mod s //linear probing to check at i+1,i+2,i+3,..............

if array[temp] == key]

print("key is present at temp location")

flag=1

break

end if

end while

if flag==0 //if key is not present

return null   

end if

end if