Practice
Learn
← Quit
0 / 0 correct
Algorithms
Medium
1 of 203
Which statement about merge sort is true?
A
Worst case O(n^2)
B
Unstable but faster than quicksort in practice
C
O(n log n) in all cases, stable, and uses O(n) extra memory for arrays
D
In-place with O(1) extra memory