GATE Computer Science (CS) 2012 Solved Paper
© examsiri.com
Question : 49 of 65
Marks:
+1,
-0
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:
Go to Question: