/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

23 votes172 views3 answers
Flutter datetime format
C++
10 votes175 views2 answers
2d vector c++ declaration
C++
0 vote202 views1 answer
Find number of 1s in a binary cv::mat image
C++
0 vote151 views1 answer
C++ rgb code
C++
0 vote172 views1 answer
The statement vector vector int matrix(100 vector int (50 100) ) declares
C++
2 votes164 views1 answer
Cin.tie c++
C++
9 votes169 views3 answers
Log base c++
C++
1 vote163 views2 answers
Substring function in c++
C++
0 vote167 views1 answer
C++ put a function in a other thread
C++
1 vote160 views1 answer
Std::queue
C++

Share