Interpolation Search
Interpolation Search Interpolation search is a search algorithm for sorted numeric arrays. Like binary search, it repeatedly narrows the search interval. Unlike binary search, it does not always choose the middle position. It estimates where the target should be based on the values at the ends of the interval. This works well when values are close to uniformly distributed. For example, if the target is near the value at the...