/C++/Euclid algorithm

Euclid algorithm

Gcd algorithm

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

2

Source: en.wikipedia.org

Euclid algorithm

int Euclid(int a, int b)
{
    int r;
    while(b != 0) 
    {
         r = a % b;
         a = b; 
         b = r; 
    }
    return a; 
}

1

Euclid algorithm

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

0

Euclid's algorithm

def GCF(a,b):
  if a == b: return a
  else: return GCF(abs(a-b), min(a,b))

0

Euclid algorithm

def MCD(a,b):
    while b != 0:
        a, b = b, a % b
    return a

0

Similar codes

0 vote189 views1 answer
Madiar loh
C++
1 vote374 views1 answer
Have unique vector after sorting vector
C++
0 vote229 views1 answer
Warning: base will be initialized after
C++
0 vote246 views2 answers
Lcm in c++
C++
5 votes178 views2 answers
Sleep c++ windows
C++
0 vote202 views1 answer
Google test assert throw
C++
0 vote184 views1 answer
RotateArray
C++
0 vote190 views1 answer
ImportError: cannot import name 'TFLiteConverter' from 'tensorflow.lite'
C++
0 vote169 views1 answer
F && T || !(T) && F
C++
0 vote196 views1 answer
No such file or directory in c++
C++

Share