quicksort.ex

defmodule Quicksort do

  def sort([]), do: []

  def sort([head|tail]) do
    {low, high} = Enum.partition(tail, &(&1 < head))
    sort(low) ++ [head] ++ sort(high)
  end

end