Evaluate two sorting or two search algorithms : Bisection/Binary search - Iterative implementation

The video tutorial covers the iterative implementation of a search function, starting with an initial setup and correcting the function to find numbers in a list. It addresses different cases where the number is greater or less than the midpoint and finalizes the implementation with test cases. The video concludes with testing the implementation and hints at a future recursive approach.

How does the function handle the case when the number to search is less than the first midpoint?

What is the role of the 'stop' variable in the search algorithm?

What condition is checked to determine when to exit the while loop?

Why is it necessary to include the equals condition in the while loop?