Open In App

UGC-NET | UGC-NET CS 2017 Dec 2 | Question 24

Like Article
Like
Save
Share
Report

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)
(D) O(n3)


Answer: (B)

Explanation: Refer: GATE-CS-2012 | Question 37

Option (B) is correct.

Quiz of this Question


Last Updated : 15 Mar, 2018
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads