Naïve quick sort
Language: Erlang
qsort([]) -> [];
qsort([H|T]) ->
Smaller = [N || N <- T, N =< H],
Bigger = [N || N <- T, N > H],
qsort(Smaller) ++ [H] ++ qsort(Bigger).
Reveal More
Language: Erlang
qsort([]) -> [];
qsort([H|T]) ->
Smaller = [N || N <- T, N =< H],
Bigger = [N || N <- T, N > H],
qsort(Smaller) ++ [H] ++ qsort(Bigger).