What are the updated values of high and low in the array if the element being searched is greater than the value at calculated index in interpolation search? (pos = current position)
(a) low = pos + 1, high remains unchanged
(b) high = pos – 1, low remains unchanged
(c) low = low +1, high = high – 1
(d) low = pos +1, high = pos – 1
I have been asked this question by my college director while I was bunking the class.
This question is from Searching in portion Searching of Data Structures & Algorithms II