Exploring Binary Searches CodeHS

The Binary Search algorithm works by testing a mid$-$point, then eliminating half of the list.

In this exercise, you are going to take our binary search algorithm and add print statements so that you can track how the search executes.

Inside of the recursive binary search function, add print statements to print out the starting, ending, and midpoint values each time.

Then as you test a value, print out the results, either too high, too low, or a match.

Sample Output

Starting value: $0$

Ending value: $9$

Testing midpoint value: $4$

Too high!

Starting value: $0$

Ending value: $3$

Testing midpoint value: $1$

Too low!

Starting value: $2$

Ending value: $3$

Testing midpoint value: $2$

Match!S