Interpolation search vs Binary search – Searching and Sorting – On average the interpolation search makes about log(log(n)) comparisons(if the elements are uniformly distributed), where n is the number of elements to be searched.
linear search in c
2 Articles
2
Interpolation Search – searching and sorting algorithm- The Interpolation Search is an improvement over Binary Search for instances, where the values .