Mergesort time complexity
- Acheck_circle
O(n log n)
- B
O(n²)
- C
O(n)
- D
O(2ⁿ)
Explanation
Standard divide-and-conquer recursion.
Sorting
AP Computer Science A· difficulty 4/5
Want 10 more like this — adaptive to your weak spots?
AP Computer Science A· difficulty 4/5
Mergesort time complexity
O(n log n)
O(n²)
O(n)
O(2ⁿ)
Explanation
Standard divide-and-conquer recursion.
Want 10 more like this — adaptive to your weak spots?