Time complexity for sorting a string

I’m not able to understand how the time complexity of sorting a string in any language is generally O(n*logn).
Can someone please shed some light on this?

Thank you!