procedure Mergesort (var A: array[1..n] of integer; i, j: integer);
begin
  if i < j
  then begin
       m := (i + j - 1)/2;
       Mergesort (A, i, m);
       Mergesort (A, m+1, j);
       Merge (A, i, m, j); { Intercala A[i..m] e A[m+1..j] em A[i..j] }
       end;
end;