I just solved a problem where some other solution had a dictionary of lowercase English characters. However, the space complexity is said to be O(1) as dictionary can have at most 26 elements (a - z).
So if I want to sort a string consisting of only lowercase English characters, will the sorting be done in constant time? O(26 log(26)).

Any response is appreciated. I am bad at math.