// mergesort on n elementsWhat is the time complexity?
- A
O(n)
- Bcheck_circle
O(n log n)
- C
O(log n)
- D
O(n^2)
Explanation
Mergesort divides log n levels and merges O(n) per level: O(n 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?