PA of Algorithms Q84

0. 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

Answer
Comment
Array

Option : B
Explanation :
Recurrence relation for merge sort
T (n) = 2 T (n/2) + n
So T (n) = O(n logn)
but instead of integers whose comparison take O(1) time, we are given n strings so to compare strings we need O(n) time hence complexity is Q(n² logn)

Forgot your password?

I agree with the Terms.