September 2017 Update

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

@@ -1,9 +1,12 @@
 defmodule QuickSort do
-  def qsort([]) do
-    []
+  def qsort([]), do: []
+
+  def qsort([_|_] = list) do
+    List.flatten do_qsort(list)
   end
-  def qsort([pivot | rest]) do
-    { left, right } = Enum.partition(rest, fn(x) -> x < pivot end)
-    qsort(left) ++ [pivot] ++ qsort(right)
+
+  defp do_qsort([pivot | rest]) do
+    {left, right} = Enum.split_with(rest, &(&1 < pivot))
+    [qsort(left), pivot, qsort(right)]
   end
 end