Program Algorithm;

{ Bubble sort.
  Described on page 106 of "The Art of Computer Programming"
  volume 3 / "Sorting and Searching" by Donald E. Knuth. 
  Programmed as in: Turbo Pascal 7, The Complete Reference, page 697 }

const
  N = 25;
var
  m : word;
  rij : array[1..N] of word;

procedure Bubble;

var
  i,j : word;

procedure Switch(var A, B : word);
var
  c : word;
begin
  c := A;
  A := B;
  B := c;
end;

begin
  for i := 2 to N do
   for j := N downto i do
    if rij[j-1] > rij[j] then
     Switch(rij[j], rij[j-1]);
end;

begin
  rij[1] := Random(3*N)+1;
  for m := 1 to N do
    rij[m] := Random(3*N)+1;
  for m := 1 to N do
    Write(rij[m],' ');
  Writeln;

  Bubble;

  for m := 1 to N do
    Write(rij[m],' ');
  Writeln;
end.