 Instead of calculating the midpoint, interpolation search estimates the position of the target value, taking into account the lowest and highest elements in the array as well as length of the array.It works on the basis that the midpoint is not the best guess in many cases.For example, if the target value is close to the highest element in the array, it is likely to be located near the end of the array.