3 ms·

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 all

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.

sangupta 10y ago
I will read more about bucketsort and update the article as necessary.
- EllipticCurve 10y ago
  I have a simple Python implementation of Countingsort, Bucketsort and Radixsort, if it helps: https://github.com/MauriceGit/Advanced_Algorithms https://github.com/MauriceGit/Advanced_Algorithms
  - sangupta 10y ago
    Thanks a bunch for the link.
  - sangupta 10y ago
    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.