Identifying the binary search pattern

The binary search algorithm is one of the most powerful search algorithms that is used to solve many types of search and optimisation problems involving a sorted search space. These are generally easy or medium problems where we need to search for a value in a sorted sequence. Most of the time, searching is often a subproblem within a larger, more complex problem.

If the problem statement or its solution follows the generic template below, it can be solved by applying the upper bound algorithm.