=+28.4. A bubble-sort algorithm is defined in the following mamer:

procedure bubblesort:

var i. t. integer:

begin repeat until t=a[1]

t := a[1]:

for j := 2 to n do if alj-11 > aljl then begin t=alj-11:

alj-11 := alj]:

aljl := t;

end endrep end