Sorting algorithms/Quicksort: Difference between revisions
m
→{{header|Pascal}}
Line 7,708:
for I := 0 to High(A) - 1 do
Write(A[I], ', ');
if Length(A) > 0 then
WriteLn(A[High(A)], ']');▼
Write(A[High(A)]);
end;
| |||