/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 vote342 views1 answer
Tarray ue4 c++
C++
0 vote339 views1 answer
Get value of enum cpp
C++
1 vote336 views1 answer
Locate specific string letters c++
C++
0 vote307 views1 answer
New expression
C++
2 votes308 views2 answers
Run cmd command c++
C++
3 votes426 views2 answers
C++ map insert
C++
0 vote325 views1 answer
Read large files part by part in C++
C++
0 vote319 views3 answers
Iterator in c++
C++
0 vote376 views1 answer
Get type of variable in c++
C++
0 vote309 views1 answer
How to play sounds in c++
C++

Share