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
What should the recursive equation?
I thought that complexity is T(n)= 2T(n/2) + n2. But this gives a complexity of O(n2) using Master's theorem. This complexity turns out to incorrect according to the answers.
Can someone try to obtain the answer using Recurrence relation,I tried but it was giving O(n^2)
Hope this helps:)