Merge sort time complexity
- A
O(n)
- B
O(log n)
- Ccheck_circle
O(n log n)
- D
O(n²)
Explanation
Divide and conquer: log n levels × n work per level.
Recursive Searching and Sorting (Binary Search, Merge Sort)
AP Computer Science A· difficulty 4/5
Want 10 more like this — adaptive to your weak spots?
Related questions
- csa-r2-algo-005
How many iterations occur before the loop ends?…
chevron_right - csa-arr-019
Binary search has time complexity…
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