lambda1@tg says to YSITD However, non-comparison-based sorting algorithms can have a worst case time complexity better than O(n log n)