/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

1 vote114 views1 answer
How to pronounce aesthetic
Python
1 vote106 views1 answer
How to use Python Glob Module
Python
12 votes105 views4 answers
How to add two numbers in python
Python
3 votes118 views2 answers
Python replace space with underscore
Python
0 vote114 views1 answer
How to make an ai
Python
0 vote140 views1 answer
How to order randomly in django orm
Python Django
1 vote101 views1 answer
Boolean python meaning for idiots
Python
0 vote130 views1 answer
Streamlit change tab name
Python
3 votes95 views2 answers
Multiple variable input in python
Python
0 vote110 views1 answer
Python get num chars
Python

Share