Another update from ingydotnet^djgoku

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

@@ -0,0 +1,9 @@
+defmodule QuickSort do
+  def qsort([]) do
+    []
+  end
+  def qsort([pivot | rest]) do
+    { left, right } = Enum.partition(rest, fn(x) -> x < pivot end)
+    qsort(left) ++ [pivot] ++ qsort(right)
+  end
+end