Searching for an Efficient Binary Search Algorithm in C

Programmers often seek to implement efficient binary search algorithms that provide the benefits of logarithmic time complexity. One common requirement is for the algorithm to return an iterator pointing to the search result rather than a simple boolean indicating its existence.

The C Standard Library provides std::binary_search in the header, but it only returns a boolean. As noted by the questioner, this can be frustrating for situations where the speed of a binary search is desired and the data is known to be sorted.

Fortunately, there are alternative implementations available that offer the desired functionality. One popular option is to use a custom algorithm that leverages the std::lower_bound, std::upper_bound, or std::equal_range functions. Here's a simplified version of such an implementation:

template
Iter binary_find(Iter begin, Iter end, T val) {
    // Determine the lower bound using binary search
    Iter i = std::lower_bound(begin, end, val);

    // If the element is found, return the iterator to it
    if (i != end && !(val 
Alternatively, a std::set can be used, which guarantees the ordering of elements and provides the find method that returns an iterator to the desired item. However, it's important to consider if the requirements are compatible with the use of a set, particularly in cases where multiple instances of the same element need to be stored.