Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
saikiran31415
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by saikiran31415
0
votes
1
GATE CSE 2012 | Question: 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 $O (n \log n) $ $ O(n^{2} \log n) $ $ O(n^{2} + \log n) $ $ O(n^{2}) $
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$O (n \log...
28.6k
views
answered
Oct 24, 2022
Algorithms
gatecse-2012
algorithms
sorting
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register