/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

1 vote144 views1 answer
GetCurrentThreadId c
C++
0 vote141 views1 answer
Const in c++ is same as globle in python
C++
0 vote167 views1 answer
Initialize 2d array c++ memset
C++
0 vote137 views1 answer
Move elements from vector to unordered_set
C++
0 vote154 views1 answer
C++ allocate dynamic with initial values
C++
1 vote140 views1 answer
Const char to string
C++
0 vote103 views1 answer
Prefix array algorithm in c++
C++
0 vote150 views1 answer
C++ while true
C++
2 votes148 views1 answer
Eosio multi index clear
C++
0 vote131 views1 answer
Insertion overloading in c++
C++

Share