/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 vote215 views1 answer
Use regex replace in c++
C++
0 vote260 views1 answer
Iterate over map c++17
C++
0 vote188 views1 answer
How to print hex of char c++
C++
1 vote219 views1 answer
C++ arrray
C++
0 vote213 views2 answers
Format c++ discord
C++
0 vote211 views1 answer
Traverse string in cpp
C++
0 vote229 views1 answer
How to merge string array in C++
C++
0 vote215 views1 answer
Free pair c++
C++
16 votes222 views1 answer
If vector contains value c++
C++
4 votes202 views2 answers
C++ cin operator
C++

Share