modifbubble.pas

Implementations of different methods of sorting: BinaryInsertions.pas BubbleSort.pas HeapSort.p

procedure BubbleSort (n : word);
var
    i, j : word;
    tmp  : integer;

begin
    for i := 1 to n - 1 do begin
        if A[i] > A[i+1] then begin

            tmp    := A[i];
            A[i]   := A[i+1];
            A[i+1] := tmp;

            for j := i downto 2 do begin
                if (A[j] < A[j-1]) then begin

                    tmp    := A[j];
                    A[j]   := A[j-1];
                    A[j-1] := tmp;

                end else break;
            end;
        end;
    end;
end;