Hacker News Reader

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.

Of course. But nowadays, space complexity is more and more important, which makes every sorting algorithm that is > O(n) not sufficiently efficient.

Just to make sure, are you referring to bucket sort and similar algorithms or something else?