Interpolation search works better than Binary Search for a sorted and uniformly distributed array.
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. In the worst case (for instance where the numerical values of the keys increase exponentially) it can make up to O(n) comparisons.
Sources:
http://en.wikipedia.org/wiki/Interpolation_search
Practice Tags :
Recommended Posts:
- Interpolation Search
- Why is Binary Search preferred over Ternary Search?
- Count number of occurrences (or frequency) in a sorted array
- Find the repeating and the missing | Added 3 new methods
- Find the minimum element in a sorted and rotated array
- Largest gap in an array
- Maximum product quadruple (sub-sequence of size 4) in array
- Closest product pair in an array
- Minimum value of “max + min” in a subarray
- Number of positions with Same address in row major and column major order
Writing code in comment? Please use ide.geeksforgeeks.org, generate link and share the link here.