What happens to the search space in each iteration of binary search?

What happens to the search space in each iteration of binary search?

Step 1: Start with a sorted list of numbers.
Step 2: Identify the middle element of the list.
Step 3: Compare the middle element with the target number you are searching for.
Step 4: If the middle element is equal to the target, you have found the number.
Step 5: If the middle element is less than the target, discard the left half of the list (including the middle element).
Step 6: If the middle element is greater than the target, discard the right half of the list (including the middle element).
Step 7: Repeat steps 2 to 6 with the new, smaller list (the remaining half).
Step 8: Each time you repeat the process, the search space (the list you are looking at) gets smaller, specifically halving in size.

No concepts available.