Rosetta Code

Sorting algorithms/Insertion sort: Difference between revisions

Page Discussion

Sorting algorithms/Insertion sort (view source)

Revision as of 06:31, 3 January 2015

308 bytes removed ,  9 years ago
ML section, mLite subsection
(ML section, mLite subsection)
Line 2,059:
while output = A<i>; i = ?lt(i,aSize) i + 1 :s(while)
end</lang>
 
=={{header|Standard ML}}==
<lang sml>fun insertion_sort cmp = let
fun insert (x, []) = [x]
| insert (x, y::ys) =
case cmp (x, y) of GREATER => y :: insert (x, ys)
| _ => x :: y :: ys
in
foldl insert []
end;
 
insertion_sort Int.compare [6,8,5,9,3,2,1,4,7];</lang>
 
=={{header|TI-83 BASIC}}==
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/42899"