2 ms·

Or a quicksort in constant memory.

• coldtea 10y ago
  Haskell, if that's where the sneer is addressed to, absolutely gives you that. It's just toy first-timer Haskell examples of quicksort (that still work, mind you) that don't. But then again, take a language like C, and consider how many things (like proper error handling) are missing from 99% of the toy tutorial examples available.