Delphi calculates the greatest common divisor of two numbers by recursion

From , 4 Years ago, written in Delphi (Object Pascal), viewed 53 times.

function GCD2(const A, B: Integer): Integer;
begin
  if B = 0 then
    Result := Abs(A)
  else
    Result := GCD2(B, A mod B);
end;

Reply to "Delphi calculates the greatest common divisor of two numbers by recursion"

Here you can reply to the paste above

Author What's your name?

Title Give your paste a title.

Language What language is your paste written in?

Your paste Paste your paste here

Create Shorturl Create a shorter url that redirects to your paste?

Private Private paste aren't shown in recent listings.

Delete After When should we delete your paste?

Spam protection Type in the letters