13. You benchmark QuickSort and Measure that its running time on random permutations doubles when n grows from 2M to 4M. Which average-case complexity class is most consistent with this observation?
(A) O(n)
(B) O(n log log n)
(C) O(n log n)
(D) O(n)
(E) O(n²)

相關試題

相關試卷