3 ms·
Functional programming is poorly suited to implementing Quicksort because a real Quicksort sorts in-place. It relies on mutable state. See: https://wiki.haskel
by mrob 10y ago
Functional programming is poorly suited to implementing Quicksort because a real Quicksort sorts in-place. It relies on mutable state. See:
https://wiki.haskell.org/Introduction/Direct_Translation https://wiki.haskell.org/Introduction/Direct_Translation