Sorting algorithms/Insertion sort: Difference between revisions

Content added Content deleted
Line 3,897:
begin
Write('[');
for I := 0 to High(A) - 1 do
if I < High(A) then Write(A[I], ', ');
else WriteWriteLn(A[IHigh(A)], ']');
WriteLn(']');
end;
 
Retrieved from "https://rosettacode.org/wiki/Sorting_algorithms/Insertion_sort"