Hacker News Reader

Yeah, well, now you get an exception. Not much better...

You should look into bucketsort. That allows you to sort in finite universes in Theta(n+k) without allocating huge arrays for large integers.

View on HN

I will read more about bucketsort and update the article as necessary.

I have a simple Python implementation of Countingsort, Bucketsort and Radixsort, if it helps: https://github.com/MauriceGit/Advanced_Algorithms

Thanks a bunch for the link.

Wouldn't using a sparse bit-array be equivalent to using Bucketsort in space-complexity, but more efficient in time-complexity, or am I missing something here.

Reply on news.ycombinator.com