Binary search has time complexity
- A
O(1)
- B
O(n)
- Ccheck_circle
O(log n)
- D
O(n²)
Explanation
Each step halves the search range.
AP Computer Science A· difficulty 4/5
Binary search has time complexity
O(1)
O(n)
O(log n)
O(n²)
Explanation
Each step halves the search range.
Want 10 more like this — adaptive to your weak spots?