/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

9 votes277 views2 answers
C++ remove last element from array
C++
51 votes265 views3 answers
Phph date
C++
111 votes602 views6 answers
Convert integer to string c++
C++
3 votes219 views1 answer
Reference function in c++
C++
0 vote218 views1 answer
Cpp map contains
C++
0 vote194 views1 answer
Stack implementation through linked list
C++
0 vote222 views1 answer
++ how to write quotation mark in a string
C++
-1 vote229 views1 answer
C++ set console title
C++
2 votes194 views1 answer
Runtime Error: Runtime ErrorBad memory access (SIGBUS)
C++
0 vote196 views1 answer
Stream Overloading
C++

Share