Anything recursive can be written iteratively.
As a final exercise, we’ll implement the binary search algorithm using iteration.
Our strategy remains largely the same as the recursive approach which used pointers.
Instead of recursive calls, we’ll substitute a
You’ll need to: