/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 vote212 views3 answers
C++ comment
C++
0 vote179 views1 answer
Cpp cout more than 1 value
C++
-1 vote190 views3 answers
Convert c code to c++
C++
0 vote185 views1 answer
Http://nv-study.ru/http://nv-study.ru/http://nv-study.ru/
C++
0 vote407 views1 answer
C++ find object in vector by attribute
C++
0 vote218 views1 answer
Simple program for sign in and sign up in c++
C++
2 votes241 views1 answer
Switch case with string c++
C++
0 vote188 views1 answer
C++ erase remove
C++
0 vote184 views2 answers
Generating unique id for an object in c++
C++
6 votes171 views6 answers
Ue4 log
C++

Share