src/code/2/qs.exs


1
2
3
4
5
6
7
8
9
10
11
12
13

defmodule Quicksort do
  def sort([]), do: []
  def sort([h|t]) do
    {lower, upper} = t |> Enum.partition(&(&1 <= h))
    sort(lower) ++ [h] ++ sort(upper)
  end
end

1..10
  |> Enum.shuffle
  |> IO.inspect
  |> Quicksort.sort
  |> IO.inspect