aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

June 2018 Update

Browse source
This commit is contained in:
Ingy döt Net 2018-06-22 20:57:24 +00:00
parent ba8067c3b7
commit 22f33d4004
5278 changed files with 84726 additions and 14379 deletions
Download patch file Download diff file Expand all files Collapse all files

7
Task/Sorting-algorithms-Quicksort/Standard-ML/sorting-algorithms-quicksort-1.ml Normal file
View file

@ -0,0 +1,7 @@
fun quicksort [] = []
| quicksort (x::xs) =
let
val (left, right) = List.partition (fn y => y<x) xs
in
quicksort left @ [x] @ quicksort right
end

14
Task/Sorting-algorithms-Quicksort/Standard-ML/sorting-algorithms-quicksort.ml → Task/Sorting-algorithms-Quicksort/Standard-ML/sorting-algorithms-quicksort-2.ml
View file

@ -1,17 +1,3 @@
fun quicksort [] = []
| quicksort (x::xs) =
let
val (left, right) = List.partition (fn y => y<x) xs
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