Merge-sort a string

Given a list of \(n\) strings each of length \(n\). What will be the worst case running time of sorting the strings in lexicographic order using merge-sort algorithm?

×

Problem Loading...

Note Loading...

Set Loading...