/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 vote163 views1 answer
Nested conditional operator
C++
3 votes157 views2 answers
C++ vector extend vector
C++
0 vote173 views1 answer
C++ vector fill
C++
0 vote168 views1 answer
Print pattern and space in cpp
C++
0 vote183 views1 answer
Has substr c++
C++
0 vote182 views1 answer
Three way comparison operator c++
C++
0 vote161 views1 answer
Is obje file binary??
C++
1 vote211 views2 answers
Pain
C++
1 vote187 views1 answer
Save all output in log file c cpp
C++
0 vote193 views1 answer
Waiting in a serial as the spool reflect the queue operation. Demonstrate Printer Behavior in context of Queue.Subject to the Scenario implement the Pop and Push Using C++.
C++

Share