Home
Insert
Update snippet 'Insertion Sort on List'
Title
Description
A continuation function takes the result when it is computed. Here is an implementation of sorting on List via insertion.
Source code
// An insert function let insert x lst = let rec insertCont x cont = function | [] -> cont ([x]) | h::t as l -> if x<=h then cont(x::l) else insertCont x (fun accLst -> cont(h::accLst)) t insertCont x (fun x -> x) lst // Sorting via insertion let insertionSort l = let rec insertionSortAcc acc = function | [] -> acc | h::t -> insertionSortAcc (insert h acc) t insertionSortAcc [] l let lst = [24;33;17;-5;-16;0;1;4;-3;2;8;-19] let res = insertionSort lst (*Results*) //val res : int list = [-19; -16; -5; -3; 0; 1; 2; 4; 8; 17; 24; 33]
Tags
insertionsort
continuation
insertionsort
continuation
Author
Link
Reference NuGet packages
If your snippet has external dependencies, enter the names of NuGet packages to reference, separated by a comma (
#r
directives are not required).
Update
