/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 vote201 views1 answer
C++ do every 1 minutes
C++
18 votes183 views5 answers
C++ random number
C++
2 votes192 views3 answers
How to find length of character array in c++
C++
0 vote244 views1 answer
Java to puthon converter
C++
2 votes182 views1 answer
Retu7rn this c++
C++
0 vote225 views2 answers
C++ map key exists
C++
-1 vote192 views1 answer
I need to write an int function in which there are only cout statements and if I return 0/1 it prints them too.
C++
1 vote199 views1 answer
Avrational compare
C++
0 vote198 views1 answer
Hello world in c/++
C++
0 vote189 views1 answer
Javascript if else exercises
C++

Share