4 ms·
As much as I hate the title of this post, I think the author has a point. I've also seen this same thing come up when comparing implementations of quicksort in
by rifung 11y ago
As much as I hate the title of this post, I think the author has a point.
I've also seen this same thing come up when comparing implementations of quicksort in Haskell to that of other languages. They always show a short, elegant implementation in Haskell, but the issue is that it's not really quicksort as it doesn't do the sort in place.
- gohrt 11y ago> it doesn't do the sort in place. That's one of the easiest ways to raise hackles among Haskellers -- they believe that parallelizability, not in-place sort, is the defining characteristic of quicksort.