Binary search tricks

1. What are the techniques used by binary search?
2. Is binary search tough?
3. Is anything faster than binary search?

What are the techniques used by binary search?

Binary search is an efficient algorithm for finding an item from a sorted list of items. It works by repeatedly dividing in half the portion of the list that could contain the item, until you've narrowed down the possible locations to just one. We used binary search in the guessing game in the introductory tutorial.

Is binary search tough?

Conceptually, binary search is a very easy to understand algorithm. However, implementing it is very difficult, especially when you try to implement many variants of it.

Is anything faster than binary search?

Interpolation search works better than Binary Search for a Sorted and Uniformly Distributed array. Binary Search goes to the middle element to check irrespective of search-key. On the other hand, Interpolation Search may go to different locations according to search-key.