Sorting algorithms/Insertion sort: Difference between revisions
Content added Content deleted
(Forth) |
(Added Ada) |
||
Line 12: | Line 12: | ||
Writing the algorithm for integers will suffice. |
Writing the algorithm for integers will suffice. |
||
=={{header|Ada}}== |
|||
type Data_Array is array(Natural range <>) of Integer; |
|||
procedure Insertion_Sort(Item : in out Data_Array) is |
|||
First : Natural := Item'First; |
|||
Last : Natural := Item'Last; |
|||
J : Integer; |
|||
Value : Integer; |
|||
begin |
|||
for I in (First + 1)..Last loop |
|||
Value := Item(I); |
|||
J := I - 1; |
|||
while J in Item'range and then Item(J) > Value loop |
|||
Item(J + 1) := Item(J); |
|||
J := J - 1; |
|||
end loop; |
|||
Item(J + 1) := Value; |
|||
end loop; |
|||
end Insertion_Sort; |
|||
=={{header|Common Lisp}}== |
=={{header|Common Lisp}}== |