2.5 Binary Search

Recite Binary Search (in english-pseudocode) §

$\text{1. Left and Right are two pointers which start at the first and last index of the array}$ $\text{2. While Left < Right, do the following:}$ $\text{3. Mid = (Left+Right)//2}$ $\text{4. Check if the Mid index is a match}$ $\text{5. Return Mid}$ $\text{6. If not, check whether the Mid number is higher than the desired number}$ $\text{7. Right = Mid - 1}$

The idea 🗝️

The idea is to…