Anonymous user
Sorting algorithms/Bubble sort: Difference between revisions
→{{header|Delphi}}
Line 652:
TArray = array[0..15] of TItem; // static array
{$ENDIF}
{$DEFINE TESTSORTED}
procedure BubbleSort(var A: TArray);
Line 657 ⟶ 659:
Item: TItem;
I, J: Integer;
{$IFDEF TESTSORTED}
Sorted: Boolean;
{$ENDIF}
begin
for I:= Low(A) + 1 to High(A) do begin
{$IFDEF TESTSORTED}
Sorted:= True;
{$ENDIF}
for J:= High(A) downto I do begin
if A[J - 1] > A[J] then begin
Line 665 ⟶ 673:
A[J - 1]:= A[J];
A[J]:= Item;
{$IFDEF TESTSORTED}
Sorted:= False;
{$ENDIF}
end;
end;
{$IFDEF TESTSORTED}
if Sorted then Break;
{$ENDIF}
end;
end;
| |||