qsort([]) -> []; qsort([Pivot|T]) -> qsort([X || X <- T, X < Pivot]) ++ [Pivot] ++ qsort([X || X <- T, X >= Pivot]).
(taken from ‘Programming Erlang’ by the pragmatic programmers).
That’s just…beautiful. Quicksort in 4 lines. Nothing extraneous, just the pure recursive algorithm.
Erlang is bending my mind, but that’s okay…it needs a little kick every so often.