sort1.pas

this is a lp0 compilator new

PROGRAM Main;

TYPE
   SortArray = ARRAY [1..10] OF INTEGER;

VAR
   X            : INTEGER;
   Key     	: SortArray;

PROCEDURE Merge ( Source : SortArray;
	          VAR Destination : SortArray;
	          Lower, Mid, Upper : INTEGER );
VAR
   S1, S2, D	: INTEGER;

BEGIN { PROCEDURE Merge }
   { Initialize Pointers }
   S1 := Lower;
   S2 := Mid + 1;
   D := Lower;

   { Repeat comparison or current items from each list }
   { Move what is left of remaining list }
   IF ( S1 > Mid ) THEN
      BEGIN
         FOR S2 := S2 TO Upper DO 
            BEGIN
               Destination[D] := Source[S2];
               D := D + 1;
            END;
      END
   ELSE
      BEGIN
         FOR S1 := S1 TO Upper DO 
            BEGIN
               Destination[D] := Source[S1];
               D := D + 1;
            END;
      END;

END; { of Procedure Merge }


BEGIN { PROGRAM Main }


END.   { of PROGRAM Main }


   MergeArray ( Destination, Source1, Source2, D, S1, S2, Mid, Upper );
   { Repeat comparison or current items from each list }
   REPEAT
      IF ( Source[S1] < Source[S2] ) THEN
         BEGIN
            Destination[D] := Source[S1];
            S1 := S1 + 1;
         END
      ELSE
         BEGIN
            Destination[D] := Source[S2];
            S2 := S2 + 1;
         END;
      D := D + 1;
   UNTIL ( S1 > Mid ) OR ( S2 > Upper );