Sorting algorithms/Insertion sort: Difference between revisions

{{works with|ALGOL 68G|Any - tested with release mk15-0.8b.fc9.i386}}

{{works with|ELLA ALGOL 68|Any (with appropriate job cards) - tested with release 1.8.8d.fc9.i386}}

 

PROC in place insertion sort = (REF[]DATA item)VOID:

in place insertion sort(ref data);

FOR i TO UPB ref data DO print(ref data[i]) OD; print(new line);

Output:

=={{header|AutoHotkey}}==

contributed by Laszlo on the ahk [http://www.autohotkey.com/forum/post-276481.html#276481 forum]

=={{header|Clojure}}==

Translated from the Haskell example:

(letfn [(insert ([raw x](insert [] raw x))

([sorted [y & raw] x]

(reduce insert [] data)))

;Usage:(in-sort! [6,8,5,9,3,2,1,4,7])

 

=={{header|Common Lisp}}==

 

=={{header|Erlang}}==

-export([insertion/1]).

 

insert(X,[]) -> [X];

insert(X,L=[H|_]) when X =< H -> [X|L];

 

And the calls:

{ok,sort}

2> sort:insertion([5,3,9,4,1,6,8,2,7]).

 

=={{header|Forth}}==

dup @ >r ( r: v ) \ v = a[i]

begin

create test 7 , 3 , 0 , 2 , 9 , 1 , 6 , 8 , 4 , 5 ,

test 10 sort

 

=={{header|Fortran}}==

=={{header|J}}==

Solution inspired by the Common LISP solution:

Example of use:

 

=={{header|Java}}==

 

=={{header|PL/I}}==

 

=={{header|Prolog}}==

=={{header|R}}==

Direct translation of pseudocode.

{

for(i in 2:(length(x)))

x

}

 

=={{header|Ruby}}==

arr[j] := help;

end for;

 

Original source: [http://seed7.sourceforge.net/algorith/sorting.htm#insertionSort]

 

=={{header|UnixPipes}}==

read a

test -n "$a" && ( selectionsort | sort -nm <(echo $a) -)

 

=={{header|Ursala}}==

 

test program:

 

output:

<pre>