Open In App

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

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

Answer: (B)
Explanation: Refer: GATE-CS-2012 | Question 37

Option (B) is correct.
Quiz of this Question

Article Tags :
UGC-NET
Recommended Articles
1. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 4
2. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 43
3. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 47
4. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 28
5. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 33
6. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 36
7. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 37
8. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 2
9. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 3
10. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 3
11. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 4
12. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 5
13. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 6
14. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 5
15. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 1
16. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 2
17. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 3
18. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 5
19. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 6
20. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 7
21. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 8
22. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 11
23. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 12
24. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 13
25. UGC-NET | UGC-NET CS 2017 Dec 2 | Question 15