bubblesort (A : integer[]) {
    t : integer;

    for (i:= size(A)-1 to 1, step -1) {
        for (j:= 1 to k) {
            if (A[j-1] > A[j]) then {
                t:= A[j];
                A[j]:= A[j-1];
                A[j-1]:= t;
            }
        }
    }
}
