/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 vote275 views1 answer
Gfgdf
C++
38 votes308 views6 answers
Print hello world in c++
C++
4 votes307 views4 answers
Pointer
C++
0 vote258 views1 answer
Pointer address to string
C++
0 vote244 views1 answer
How to get characters through their ascii value in c++
C++
90 votes360 views5 answers
Tostring c++
C++
0 vote283 views1 answer
Colors on c++
C++
0 vote255 views1 answer
Set Specific Time in youtube Video url
C++
0 vote279 views1 answer
How to make a pointer point to a the last value in an array
C++
0 vote266 views2 answers
#define in cpp
C++

Share