/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 vote331 views1 answer
How to delete repeated element in stack c++
C++
23 votes317 views5 answers
C++ getline
C++
0 vote323 views1 answer
Cpp set time
C++
0 vote346 views2 answers
Print all number between a and b in c++
C++
0 vote306 views1 answer
How to play sound in c++
C++
0 vote315 views1 answer
Equals operator c++ overlaod
C++
14 votes333 views5 answers
Create a vector of size n in c++
C++
4 votes312 views2 answers
C++ initialize a vector
C++
1 vote343 views1 answer
Binary exponentiation
C++
3 votes321 views4 answers
Or in cpp
C++

Share