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.
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
- Interpolation Search
- Why is Binary Search preferred over Ternary Search?
- Meta Binary Search | One-Sided Binary Search
- Linear Search vs Binary Search
- Repeatedly search an element by doubling it after every successful search
- Binary Search
- Binary Search in PHP
- Binary Search a String
- Binary Search in Java
- Variants of Binary Search
- Binary Search using pthread
- Uniform Binary Search
- The Ubiquitous Binary Search | Set 1
- Binary Search (bisect) in Python