Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
→{{header|OCaml}}
No edit summary |
|||
Line 1,556:
<lang ocaml>let rec insert x = function
[] -> [x]
| y :: ys when x <= y -> x :: y :: ys
| y ::
;;
let insertion_sort lst = List.fold_right insert lst [];;
| |||