/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 vote329 views1 answer
Error: initialization with "{...}" expected for aggregate object - c++
C++
0 vote294 views1 answer
How to remove the % in zsh that show after running c++ file
C++
3 votes343 views1 answer
Reference function in c++
C++
0 vote300 views1 answer
Convert c program to c ++ online
C++
0 vote287 views1 answer
C++ execution time
C++
3 votes305 views1 answer
Initialzing a 2d vector in cpp
C++
1 vote303 views3 answers
If else c++
C++
0 vote328 views2 answers
What do you mean by smallest anagram of a string
C++
97 votes459 views6 answers
Change int to string c++
C++
0 vote298 views1 answer
Decising how many numbers after comma c++
C++

Share