Sorting algorithms/Insertion sort: Difference between revisions

Content added Content deleted

Inline

@@ Line 3,897: / Line 3,897: @@
 begin
   Write('[');
-  for I := 0 to High(A) do
+  for I := 0 to High(A) - 1 do
-    if I < High(A) then Write(A[I], ', ')
+    Write(A[I], ', ');
-    else Write(A[I]);
+  WriteLn(A[High(A)], ']');
-  WriteLn(']');
 end;