Binary Search is a very trivial algorithm to search a target value from a sorted array. It's popular among students of computer science and also during interviews it gets asked by the interviewer. It's easy. We take an array of integers already sorted and apply binary search on that array to figure out if the target value does present in that sorted array or not.
The condition can be either present or not present. If it is present we return the array index of the element else we return -1.
The algorithm is very simple, it's broken down into three parts.
1. Find and compare the middle element of the search space with the key.
2. If the key is found in the middle, just return the array index.
3. If the key is not found then choose half of the array space, based on whether the key value is smaller or greater than the mid element.
a. If the key element is smaller than the mid element, then the left side of the search space will be used otherwise, the right side of the search space will be used.
This process continues until the element is found in the search space or the total search space is exhausted.
The very standard implementation is more or less like the below in C++:
And it works. But now comes the twist, what if we want a binary search implementation that should work for most of the STLs associative containers like vector, list, array, and deque. In summary, want an implementation for STLs associative containers like vector, array, list, and deque. The idea is to develop the binary search in such a way that it can work container agnostic way. Hence followed templated approach and instead of passing the container itself used Iterator. It's a templatized Iterator-based approach. The below implementation works for std::vector, std::list, std::array, std::deque, and std::set. I've used visual studio 2022 for my implementation and the code looks like the below: