program BubbleSort;
uses crt;
const N=5;
var List : array[1..N] of integer;
    Pass, I, Temp : integer;

procedure PrintData;
var Index : integer;
begin  { PrintData }
   for Index:=1 to N do
      write (List[Index]:4);
   writeln   
end;  { PrintData }


begin { Main Program }
   clrscr;
   writeln ('<<This is the second version of Bubble Sort>>');
   writeln;
   writeln ('Enter ',N ,' integers : ');
   for I := 1 to N do
      readln(List[I]);
   writeln;
   write ('Original List ');
   PrintData;
   writeln;

   for Pass := 1 to N-1 do
      begin
         writeln ('Pass ', Pass);
         for I := 1 to (N-Pass) do
            begin
               if List[I] > List[I+1] then
                  begin
                     Temp := List[I];
                     List[I] := List[I+1];
                     List[I+1] := Temp
                  end;
               PrintData   
            end;
      end;      
   writeln;
   write ('Sorted List ');
   PrintData      
end. { Main Program }