7 ms·Only comparison-based sorting is bound by O(n log n). Non-comparison based sorts can do better.by comparison 12y agoOnly comparison-based sorting is bound by O(n log n). Non-comparison based sorts can do better.