/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

-1 vote167 views1 answer
Flags of open operation c++
C++
1 vote204 views1 answer
How to reverse a string in c++ using reverse function
C++
3 votes310 views1 answer
Extends c++
C++
1 vote178 views1 answer
Print 5 table in c++
C++
0 vote230 views3 answers
Print counting in c++
C++
5 votes174 views1 answer
Master library in c++
C++
-1 vote203 views1 answer
How to parse using stringstream
C++
0 vote179 views1 answer
C++ descending sort
C++
0 vote180 views1 answer
How to take full sentence in c++
C++
9 votes226 views2 answers
Sort vector in reverse order c++
C++

Share