Interpolation Search Algorithm

GeeksforGeeks GATE Computer Science Coupon Code-: DIGIXGFG
Interpolation search is an algorithm similar to the binary search for searching for a given target value in a sorted array. It parallels how humans search a telephone book for a particular name, the target value by which the book’s entries are ordered.

We know that binary search always chooses the middle of the remaining search space, discarding one half or the other depending on the comparison between the mid-value and the target value. The remaining search space is reduced to the part before or after the mid-position.
By comparison, at each search step, the Interpolation search calculates wherein the remaining search space the target might be present, based on the low and high values of the search space and the target’s value. The value found at this estimated position is then compared to the target value. If it is not equal, the remaining search space is reduced to the part before or after the estimated position depending on the comparison. This method will only work if calculations on the size of differences between target values are sensible.

[mr.elliotanderson]

kya yrr main bat to bataye hi nhi ki time complexity kaise log(logn) rhegi baki faltu ki bakwas kre rhe