algorithme GCD
function gcd(a, b)
if b = 0
return a
else
return gcd(b, a mod b)
Good Gull
function gcd(a, b)
if b = 0
return a
else
return gcd(b, a mod b)
int Euclid(int a, int b)
{
int r;
while(b != 0)
{
r = a % b;
a = b;
b = r;
}
return a;
} function mcd($a,$b) {
while($b) list($a,$b)=array($b,$a%$b);
return $a;
}def GCF(a,b):
if a == b: return a
else: return GCF(abs(a-b), min(a,b))def MCD(a,b):
while b != 0:
a, b = b, a % b
return a