/Python/Euclid's algorithm

Euclid's 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's algorithm

def GCF(a,b):
  if a == b: return a
  else: return GCF(abs(a-b), min(a,b))

0

Euclid algorithm

 function mcd($a,$b) {
	while($b) list($a,$b)=array($b,$a%$b);
	return $a;
}

0

Euclid algorithm

def MCD(a,b):
    while b != 0:
        a, b = b, a % b
    return a

0

Similar codes

13 votes180 views6 answers
Threading in python
Python
0 vote145 views1 answer
Create nested dictionary with user input in python
Python
0 vote172 views1 answer
Select Children of an Object With ForeignKey in Django?
Python Django
4 votes175 views5 answers
Print hello in python
Python
10 votes135 views3 answers
Fibonacci series python recursion
Python
1 vote144 views1 answer
Get video length python
Python
0 vote148 views1 answer
Find_element_by_xpath pythin
Python
69 votes160 views5 answers
Get text from txt file python
Python
0 vote124 views1 answer
Table and amorization charts using tkinter
Python
1 vote162 views2 answers
How to use screen in ubuntu
Python

Share