Hacker News new | ask | show | jobs
by comparison 4211 days ago
Only comparison-based sorting is bound by O(n log n). Non-comparison based sorts can do better.