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
- Binary Search in PHP
- Binary Search In JavaScript
- Uniform Binary Search
- Binary Search a String
- Binary Search using pthread
- Variants of Binary Search
- The Ubiquitous Binary Search | Set 1
- Binary Search in Java
- A Problem in Many Binary Search Implementations
- Must Do Coding Questions for Companies like Amazon, Microsoft, Adobe, ...
- Find the Majority Element | Set 3 (Bit Magic)
- What is the Importance of Mathematics in Computer Science?
- Count number of pairs in array having sum divisible by K | SET 2
- Find the winner of the Game to Win by erasing any two consecutive similar alphabets