Interpolation search vs Binary search
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
Recommended Posts:
- 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 in PHP
- Binary Search
- Variants of Binary Search
- Binary Search In JavaScript
- Uniform Binary Search
- Binary Search using pthread
- Binary Search a String
- Binary Search in Java
- The Ubiquitous Binary Search | Set 1
- Binary Search (bisect) in Python
- Partition the array into three equal sum segments
- Two equal sum segment range queries
- Given an array and two integers l and r, find the kth largest element in the range [l, r]
- Remove all occurrences of any element for maximum array sum
- Find the minimum number of rectangles left after inserting one into another
