/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 vote312 views1 answer
Vector with pinter cout c++
C++
1 vote301 views1 answer
Case label in c++
C++
7 votes317 views3 answers
C++ auto loop
C++
0 vote314 views1 answer
For loop f#
C++
0 vote344 views1 answer
How to print a word in c++
C++
1 vote341 views1 answer
C++ ros publisher
C++
1 vote267 views3 answers
C++ split string on newline
C++
1 vote310 views1 answer
HOW TO TURN LINK TO BUTTON IN MVC
C++
0 vote321 views1 answer
C++ foreach vector
C++
0 vote312 views2 answers
Size of unordered_set
C++

Share