/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 vote259 views1 answer
ImportError: cannot import name 'MigrateCommand' from 'flask_migrate'
Python Flask
0 vote175 views1 answer
Make a copy for parsing dataframe python
Python
0 vote204 views1 answer
Python __init_subclass__
Python
1 vote229 views1 answer
How to convert text to speech using pthon
Python
0 vote183 views1 answer
Sum up list python
Python
0 vote189 views1 answer
Return tuples form functions in Python
Python
0 vote178 views1 answer
Is plaindrome python
Python
0 vote221 views1 answer
If between two values pythpn
Python
0 vote199 views1 answer
Print all variables jupyter notebook
Python
0 vote181 views1 answer
How to add a under line of the button in tkinter python
Python

Share