Program BBSORT;
const n=10;
var a: array[1..n] of Integer;
procedure Generuj;
var i: Integer;
begin
for i:=1 to n do begin
a[i] := Random(100);
end;
end;
procedure Pis;
var i: Integer;
begin
for i:=1 to n do begin
Write(a[i]:3);
end;
WriteLn;
end;
procedure Tried;
var i,j,temp: Integer;
begin
for i:=1 to n do
for j:=1 to n-1 do begin
if (a[j]>a[j+1]) then begin
temp := a[j];
a[j] := a[j+1];
a[j+1] := temp;
end;
end;
end;
begin
Generuj;
WriteLn('Neutriedene pole');
Pis;
Poke(559,0);
Tried;
Poke(559,34);
WriteLn('Utriedene pole');
Pis;
end.