// binary search on sorted array of size nWhat is the worst-case time complexity?
- A
O(n log n)
- Bcheck_circle
O(log n)
- C
O(1)
- D
O(n)
Explanation
Binary search halves the search space each step, giving O(log n).
Recursive Searching and Sorting (Binary Search, Merge Sort)
AP Computer Science A· difficulty 2/5
Want 10 more like this — adaptive to your weak spots?
Related questions
- csa-arr-018
Binary search requires the array to be…
chevron_right - csa-hard3-023
Which statement about Java's typical binary-search algorithm is TRUE?…
chevron_right - csa-hard3-022
Performing iterative binary search for the value 17 in the sorted array shown, how many <codemid</code values are computed (i.e., how many loop iterations occur…
chevron_right