Sort Algorithms impl with Elixir

sort_algorithms.ex

# Bubble sort
defmodule Bubble do
  def sort([]), do: []  
  def sort(l) do
    round = swap_itr(l)
    cond do
      round == l -> l
      true -> sort(round)
    end
  end

  defp swap_itr([x | []]), do: [x]
  defp swap_itr([f | [s | r]]) do
    cond do
      f < s -> [f | swap_itr([s | r])]
      true  -> [s | swap_itr([f | r])]
    end
  end
end


# Insertion sort
defmodule Insertion do
  def sort(list) when is_list(list), do: sort(list, [])
  def sort([], sorted), do: sorted
  def sort([h | t], sorted), do: sort(t, insert(h, sorted))
 
  defp insert(x, []), do: [x]
  defp insert(x, sorted) when x < hd(sorted), do: [x | sorted]
  defp insert(x, [h | t]), do: [h | insert(x, t)]
end

# Is this Insertion sort?
#
#defmodule Insertion do
#  def sort([]), do: []
#  def sort(l, index \\ 0) do
#    [f | [s | r]] = l
#    cond do
#      f > s and index < length(l) -> sort(swap_index([f |[s | r]]), index + 1)
#      true -> l
#    end
#  end
#
#  def swap_index([x | []]), do: [x]
#  def swap_index([f | [s | r]]) do
#    cond do
#      f < s -> [f | swap_index([s | r])]  
#      true  -> [s | swap_index([f | r])]
#    end
#  end
#end