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
Added over 1 year ago by Segal-avatar_normal zdzolton

Refactorings

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
Added over 1 year ago by Segal-avatar_normal zdzolton