/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 vote165 views1 answer
Python parse url get parameters
Python
0 vote163 views3 answers
How to print tables using python
Python
-3 votes174 views2 answers
How to move turtle forward in python
Python
0 vote171 views1 answer
HTTP Error 403: Forbidden django account signup email
Python
1 vote126 views2 answers
Python list iterator
Python
0 vote169 views2 answers
Icpc preliminary 2018 problem
Python
4 votes182 views1 answer
Add x axis label python
Python
10 votes165 views2 answers
Check if key exists in sesison python
Python
-1 vote211 views2 answers
How to declare tuple in python
Python
7 votes158 views2 answers
How to add a image in tkinter
Python

Share