/Python/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 vote349 views2 answers
Instabot source code python library
Python
0 vote298 views2 answers
How to get the index of the first integer in a string python
Python
0 vote311 views1 answer
Python db access though ssh user
Python
0 vote308 views1 answer
Python capitilize
Python
-1 vote311 views1 answer
Add gaussian noise python
Python
2 votes318 views1 answer
Python api define bearer token
Python
4 votes299 views1 answer
How to convert types of variablesin python
Python
1 vote327 views1 answer
How to download a file in python using idm
Python
3 votes299 views2 answers
Module pygame has no member
Python
23 votes315 views4 answers
Django runserver
Python

Share