2016 Update

Task/Sorting-algorithms-Quicksort/Standard-ML/sorting-algorithms-quicksort.ml

@@ -5,3 +5,26 @@ fun quicksort [] = []
     in
         quicksort left @ [x] @ quicksort right
     end
+
+------------------------------------------------------------
+
+Solution 2:
+
+Without using List.partition
+
+fun par_helper([], x, l, r) = (l, r) |
+	par_helper(h::t, x, l, r) =
+		if h <= x then
+			par_helper(t, x, l @ [h], r)
+		else
+			par_helper(t, x, l, r @ [h]);
+
+fun par(l, x) = par_helper(l, x, [], []);
+
+fun quicksort [] = []
+  | quicksort (h::t) =
+    let
+        val (left, right) = par(t, h)
+    in
+        quicksort left @ [h] @ quicksort right
+    end;