Gate CS-2012 Question Paper With Solutions

Q. 39 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(n² log n)

(C) O(n² + log n)

(D) O(n²)

Answer: (B)

Explanation: