Hacker News new | ask | show | jobs
by trinovantes 1359 days ago
Good point but it's not exactly a free lunch. You're trading memory for the speedup.

You can also use radix sort for what I'd like to call "fake" O(n) sort since physical hardware puts an upper limit on the hidden constant.

1 comments

Radix sort generally places far more restrictions on the keys than a set would.