Anonymous user
Sorting algorithms/Bubble sort: Difference between revisions
→{{header|Delphi}}
Line 652:
TArray = array[0..15] of TItem; // static array
{$ENDIF}
procedure BubbleSort(var A: TArray);
var
Item: TItem;
begin
K:= High(A);
repeat
Sorted:= True;▼
▲ for J:= High(A) downto I do begin
if A[J - 1] > A[J] then begin
Item:= A[J - 1];
A[J - 1]:= A[J];
A[J]:= Item;
end;
end;
L:= K + 1;
until L > High(A);
end;
| |||