Sorting algorithms/Insertion sort: Difference between revisions
Sorting algorithms/Insertion sort (view source)
Revision as of 10:40, 20 November 2010
, 13 years agoadding GAP
(→{{header|Perl 6}}: Added Perl 6 solution) |
(adding GAP) |
||
Line 526:
a(j+1:i) = cshift(a(j+1:i),-1)
END DO</lang>
=={{header|GAP}}==
<lang gap>InsertionSort := function(L)
local n, i, j, x;
n := Length(L);
for i in [ 2 .. n ] do
x := L[i];
j := i - 1;
while j >= 1 and L[j] > x do
L[j + 1] := L[j];
j := j - 1;
od;
L[j + 1] := x;
od;
end;
s := "BFKRIMPOQACNESWUTXDGLVZHYJ";
InsertionSort(s);
s;
# "ABCDEFGHIJKLMNOPQRSTUVWXYZ"</lang>
=={{header|Haskell}}==
| |||