/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 vote132 views2 answers
Css window id
C++
13 votes118 views27 answers
Cpp hello
C++
1 vote169 views1 answer
Stack implementation using linked list in cpp
C++
0 vote126 views1 answer
Unknown amount of threads cpp
C++
0 vote147 views1 answer
Input time from console C++
C++
0 vote133 views1 answer
What algorithm does bitcoin use
C++
0 vote195 views1 answer
C++ functions dynamic vector
C++
3 votes129 views2 answers
Convert long int to binary string c++
C++
0 vote135 views1 answer
Remove digit from number c++
C++
3 votes185 views3 answers
C++ get char of string
C++

Share