Question

How to calculate the GCD (greatest common divisor) of two integers in Pascal

Answer 1

program GCD_Calculation;

function GCD(a, b: Integer): Integer;
begin
  while b <> 0 do
  begin
    GCD := b;
    b := a mod b;
    a := GCD;
  end;
  GCD := a;
end;

var
  num1, num2, result: Integer;

begin
  num1 := 12;
  num2 := 20;

  result := GCD(num1, num2);
  
  writeln('The GCD of ', num1, ' and ', num2, ' is: ', result);
end.



(*
run:

The GCD of 12 and 20 is: 4

*)

 

70+ SQL courses for beginners and professionals