bubblesort.pas

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

procedure BubbleSort( var  a: array  of integer; min, max: Integer);
var
    i, j, tmp: integer;
    b : boolean;

begin

    for i := min to max do begin

        f := False;

        for j := min to max-i do begin

            if A[j]>A[j+1] then begin
                tmp    := A[j];
                A[j]   := A[j+1];
                A[j+1] := tmp;
            end;
        end;
    end;

end;



i := 2;
f := true;

while (i <= N) and (F = true) do begin

    f := false;
    j := N;

    while j >= i do begin

        if X[j-1] > X[j] then begin
            tmp := X[j];
            X[j] := X[j-1];
            X[j] := tmp;
            f := true;
        end;

        dec (j);

    end;

    inc (i);

end;