/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 vote132 views1 answer
Cpp convert vector to set
C++
21 votes134 views6 answers
Random in c++
C++
2 votes134 views2 answers
Print stack c++
C++
0 vote132 views1 answer
Youtube to facebook link converter
C++
0 vote94 views1 answer
Press enter to continue c++
C++
14 votes89 views5 answers
C++ Type Casting
C++
1 vote146 views3 answers
Reverse string c++
C++
4 votes136 views2 answers
Input pdf latex
C++
1 vote132 views1 answer
How to ensure the user inouts a int and not anything else c++
C++
0 vote146 views1 answer
ImportError: cannot import name 'TFLiteConverter' from 'tensorflow.lite'
C++

Share