Recently I faced few problems where I needed to use a map of strings or sort a vector of strings.

The number of strings can be upto 10^5, but the summation of lengths of the strings won't be larger than 10^5.

Now, I wonder what is the complexity of this sorting ? And can you please explain why ?