The problem of sorting time complexity of "algorithm" string array

Title: There is a string array that sorts each string in the array alphabetically, followed by a dictionary order of the entire string array. Time complexity of the entire operation? Analysis:

• 1. Assume that the longest string length is s, and that there are n strings in the array

• 2. Sort each string: O (slogs)

• 3. Order each string in the array alphabetically: O (N*slogs)

• 4. Sort the entire string array in dictionary order: O (S*NLOGN)

Comprehensive:

Overall time complexity o = O (nslogs) + O (snlogn) = O (nslogs+sNlogn) =o (ns(logn+logs))

The problem of sorting time complexity of "algorithm" string array