/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

5 votes117 views4 answers
Split pdf
C++
1 vote118 views1 answer
C++ accessing parent class functinons
C++
1 vote115 views1 answer
Function overloading in c++
C++
0 vote125 views2 answers
Power in c++
C++
0 vote110 views1 answer
Niet werkend
C++
2 votes155 views3 answers
Online ide c++
C++
0 vote111 views1 answer
Give an algorithm for finding the ith-to-last node in a singly linked list in which the last node is indicated by a null next reference.
C++
3 votes118 views1 answer
How to find the suarray with maximum sum using divide and conquer
C++
2 votes124 views1 answer
Suppress individual warnings in visual c++
C++
0 vote118 views1 answer
Gamemaker studio
C++

Share