RosettaCodeData/Task/Greatest-common-divisor/FreeBASIC/greatest-common-divisor-2.basic
2023-07-01 13:44:08 -04:00

8 lines
229 B
Text

function gcdp( a as uinteger, b as uinteger ) as uinteger
if b = 0 then return a
return gcdp( b, a mod b )
end function
function gcd(a as integer, b as integer) as uinteger
return gcdp( abs(a), abs(b) )
end function