Which of the following best describes the iterative approach to binary search?

Which of the following best describes the iterative approach to binary search?

Step 1: Start with a sorted list of numbers and define the target number you want to find.
Step 2: Set two pointers: one at the beginning of the list (left) and one at the end of the list (right).
Step 3: While the left pointer is less than or equal to the right pointer, do the following:
Step 4: Calculate the middle index by taking the average of the left and right pointers.
Step 5: Check if the number at the middle index is equal to the target number.
Step 6: If it is equal, you have found the target and can return its index.
Step 7: If the target number is less than the number at the middle index, move the right pointer to the middle index - 1.
Step 8: If the target number is greater than the number at the middle index, move the left pointer to the middle index + 1.
Step 9: Repeat steps 3 to 8 until you find the target or the left pointer exceeds the right pointer.
Step 10: If the left pointer exceeds the right pointer, it means the target is not in the list.

No concepts available.