1.

A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is

A. O(n log n)
B. O(n2 log n)
C. O(n2 + log n
D. O(n2)
Answer» C. O(n2 + log n


Discussion

No Comment Found

Related MCQs