UGC NET CSE | November 2017 | Part 2 | Question: 24

Question

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

• A. $O (n \log n)$
• B. $O (n^{2} \log n)$
• C. $O (n^{2}+\log n)$
• D. $O(n^{3})$

Comments

https://gateoverflow.in/1762/gate2012_39