How does interpolation search algorithm estimate the position of the key in a sorted array?

Question

Answer

None of these

Answer

By checking the middle element of the array

Answer

By dividing the array into fixed-size chunks

Answer

By using a binary division regardless of data distribution

Answer

By estimating the likely position using the key’s value relative to the range of the array

Answer

By recursively comparing the key with each element from start to end

Crowdly