/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 vote117 views1 answer
How to get 4 decimal places in c++
C++
35 votes142 views6 answers
Ellipsis
C++
1 vote156 views4 answers
How to use string in c++
C++
0 vote138 views1 answer
C++ get type name of object
C++
0 vote132 views3 answers
Iterator in c++
C++
1 vote143 views1 answer
How to find the individual letters of a string c++
C++
1 vote130 views1 answer
What is time complexity of min_element()
C++
30 votes155 views5 answers
Remove value from vector c++
C++
0 vote136 views1 answer
Minimumm sort tryed
C++
14 votes209 views4 answers
Converting to string c++
C++

Share