June 2018 Update

Task/Sorting-algorithms-Quicksort/Elixir/sorting-algorithms-quicksort.elixir

@@ -1,12 +1,7 @@
-defmodule QuickSort do
+defmodule Sort do
   def qsort([]), do: []
-
-  def qsort([_|_] = list) do
-    List.flatten do_qsort(list)
-  end
-
-  defp do_qsort([pivot | rest]) do
-    {left, right} = Enum.split_with(rest, &(&1 < pivot))
-    [qsort(left), pivot, qsort(right)]
+  def qsort([h | t]) do
+    {lesser, greater} = Enum.split_with(t, &(&1 < h))
+    qsort(lesser) ++ [h] ++ qsort(greater)
   end
 end