4 ms·Sorting is O(kn) where k is the largest number. (See radix sorting)by wrsh07 10y agoSorting is O(kn) where k is the largest number. (See radix sorting)geocar 10y agoIt also requires O(k) memory which is certainly larger than L1, causing two stalls instead of one.wrsh07 10y agoIn this case, k is 26. Or ASCII value of 'z'. Either way, very cheap.