4 ms·
@wheybags I recommend achieving defined-before-use quicksort by throwing in some unnecessary Haskell syntax extensions: qs :: Ord a => [a] -> [a] qs = \cas
by 414owen 6y ago
@wheybags I recommend achieving defined-before-use quicksort by throwing in some unnecessary Haskell syntax extensions:
qs :: Ord a => [a] -> [a]
qs = \case
[] -> []
(x : (partition (< x) -> (qs -> as, qs -> bs))) -> as <> [x] <> bs