Answers for "gcd euclidean algorithm"

gcd algorithm

function gcd(a, b)
    if b = 0
        return a
    else
        return gcd(b, a mod b)

Posted by: Guest on September-22-2020

euclid algorithm

function mcd($a,$b) {
	while($b) list($a,$b)=array($b,$a%$b);
	return $a;
}

Posted by: Guest on January-02-2021

Code answers related to "gcd euclidean algorithm"