Algorithms | Sorting | Question 16

A list of n string, 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: (B)

Explanation: The recurrence tree for merge sort will have height Log(n). And O(n^2) work will be done at each level of the recurrence tree (Each level involves n comparisons and a comparison takes O(n) time in worst case). So time complexity of this Merge Sort will be O (n^2 log n) .

Quiz of this Question



My Personal Notes arrow_drop_up