Re: Naïve quick sort Refactoring of: Naïve quick sort Language: Erlang qsort([]) -> []; qsort([H|T]) -> {Bigger,Smaller} = lists:partition(fun(N) -> N > H end, T), qsort(Smaller) ++ [H] ++ qsort(Bigger). Reveal More Refactor Tweet Embed Raw Added over 1 year ago by zdzolton