funclang series4: Improved quickSort.

funclang-taddeus/series4/ass8.ml

+open List
+
 (* Sort a list l using the quicksort algorithm *)
 let rec quickSort (l:int list) =
     match l with
     | ([] | [_]) -> l
     | pivot::rest ->
-        let rec assign low high l =
+        let cmp x = x < pivot in
+        let low, high = partition cmp rest in
+        quickSort low @ pivot :: quickSort high
+        (*let rec assign low high l =
             match l with
             (* Assigning elements is done, sort the lower and higher sublists
              * individually and concatenate them with the pivot *)
@@ -13,11 +18,9 @@ let rec quickSort (l:int list) =
             | h::t -> if h <= pivot then assign (h::low) high t
                                     else assign low (h::high) t
         in
-        assign [] [] rest
+        asign [] [] rest*)
 ;;
 
-open List
-
 (* Sort a list l using the merge sort algorithm *)
 let rec mergeSort (l:int list) =
     match l with