bubblesort

(*
bubblesort
*)
const
  N = 10;

var
  pole: array[1..N] of integer;
  i, j: integer;
  pom: integer;

begin
  Randomize;
  for i := 1 to N do begin
      pole[i] := Random(100)+1;
      write (pole[i], ' ');
  end;
  writeln; 

  for j := 1 to N-1 do begin
      for i := 1 to N-1 do
          if pole[i] > pole[i+1] then begin
              pom := pole[i] ;
              pole[i] := pole[i+1] ;
              pole[i+1] := pom ;
          end;
      for i := 1 to N do  
          write (pole[i], ' ');
      writeln;   
  end;

  writeln('prvkov: ', N);
  writeln('pocet prechodov: ', j);
end.