UGC-NET | UGC-NET CS 2017 Dec 2 | Question 24
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(n2log n)
(C) O(n2 + log n)
Explanation: Refer: GATE-CS-2012 | Question 37
Option (B) is correct.
Quiz of this Question