Number of recursive calls in binary search of size 16 (worst case):
- A
8
- B
1
- Ccheck_circle
4
- D
16
Explanation
log₂(16) = 4 levels.
AP Computer Science A· difficulty 4/5
Number of recursive calls in binary search of size 16 (worst case):
8
1
4
16
Explanation
log₂(16) = 4 levels.
Want 10 more like this — adaptive to your weak spots?