In a binary search algorithm, what happens to the search space after each compar

In a binary search algorithm, what happens to the search space after each comparison?

In a binary search algorithm, what happens to the search space after each comparison?

Step 1: Start with a sorted list of items.
Step 2: Identify the middle item of the list.
Step 3: Compare the middle item with the target value you are searching for.
Step 4: If the middle item is equal to the target, you found it!
Step 5: If the middle item is less than the target, discard the left half of the list (including the middle item).
Step 6: If the middle item is greater than the target, discard the right half of the list (including the middle item).
Step 7: Repeat steps 2 to 6 with the new, smaller list until you find the target or the list is empty.

No concepts available.