Question 1 of 10
Sorted [3,6,9,12,15]. Search 3; first middle 9. Still possible?
- A. 3 only
- B. 12, 15
- C. 3, 6
- D. 9, 12, 15
Sorted [3,6,9,12,15]. Search 3; first middle 9. Still possible?
Which situation correctly blocks binary search?
Sorted [5,10,15,20,25,30,35]. Search 35; first middle index 4 (value 20). How many remain possible?
After one comparison, half is eliminated. What justifies which half to keep?
Alphabetical sorted ["be","go","me","to","we"]. Search "be"; first middle "me". Remaining?
Binary search repeatedly:
Sorted [1,2,3,4,5,6]. Target 4; first middle index 3 (value 3). Remaining?
Unsorted [7,1,9] seeking 9: student compares middle 1, discards left because 9 > 1, keeping [9], and claims this always works. Best critique?
Sorted [11,22,33,44]. Show 10 absent: first compare index 2 (22), then remaining left element 11. Comparisons used?
Which is true?