/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

20 votes182 views5 answers
Cin.getline
C++
2 votes166 views2 answers
C++ check palindrome
C++
0 vote160 views1 answer
Operators on strings c++
C++
0 vote197 views2 answers
C++ program to find prime number using function
C++
0 vote166 views3 answers
Dynamic memory c++
C++
3 votes167 views1 answer
C++ get files in directory
C++
0 vote191 views1 answer
How to declare an enum variable c++
C++
8 votes157 views3 answers
C++ check substring
C++
12 votes176 views2 answers
Inheritance
C++
19 votes162 views1 answer
Access last element in vector in c++
C++

Share