Sorting algorithms/Quicksort: Difference between revisions

Content added Content deleted

Inline

@@ Line 7,708: / Line 7,708: @@
   for I := 0 to High(A) - 1 do
     Write(A[I], ', ');
+  WriteLn(A[High(A)], ']');
-  if Length(A) > 0 then
-    Write(A[High(A)]);
-  WriteLn(']');
 end;