Quicksort in Elixir

quicksort.ex

# Not tail recursive and uses ++ :(
defmodule Quicksort do
  def sort([]), do: []
  
  def sort([head | rest]) do
    {before, after} = Enum.partition(rest, &(&1 < head))
    sort(before) ++ [head] ++ sort(after)
  end
end