3 ms·

I believe integer sorting doesn't have a lower bound of O(n log n), because you can do more with them than just comparing.

• enedil 11y ago
  Of course. But nowadays, space complexity is more and more important, which makes every sorting algorithm that is > O(n) not sufficiently efficient.
• pykello 11y ago
  Just to make sure, are you referring to bucket sort and similar algorithms or something else?