Rosetta Code

Sorting algorithms/Insertion sort: Difference between revisions

Page Discussion

Sorting algorithms/Insertion sort (view source)

Revision as of 08:45, 1 November 2022

25 bytes removed ,  1 year ago
m
→‎{{header|Pascal}}: cosmetic
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;
 
Avk
73

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/333023"