How does binary search determine the next interval to search?

How does binary search determine the next interval to search?

Step 1: Start with a sorted list of elements and define the range of the search (initially the whole list).
Step 2: Find the middle element of the current range.
Step 3: Compare the target value (the value you are searching for) with the middle element.
Step 4: If the target is equal to the middle element, you have found the target.
Step 5: If the target is less than the middle element, narrow the search to the left half of the list (the interval before the middle element).
Step 6: If the target is greater than the middle element, narrow the search to the right half of the list (the interval after the middle element).
Step 7: Repeat steps 2 to 6 until you find the target or the search interval is empty.

Binary Search Mechanism – Binary search works by repeatedly dividing the search interval in half and comparing the target value to the middle element.