Binary Search Implementation

We’ll implement the binary search algorithm and solve a practical problem with it. Let’s begin getting the idea behind the implementation, step by step.

Implementing binary search

The first decision to make is: Where do we begin the search? In this case, we don’t start from one place but two, simultaneously. We need two starting points. The only condition is that one should be in the invalid region and the other in the valid one. We’ll call them points $a$ and $b$, respectively.