/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

0 vote217 views1 answer
Seaborn boxplot legend color
Python
3 votes137 views1 answer
No module named 'django.core.urlresolvers'
Python
4 votes144 views2 answers
Use datetime python to get runtime
Python
1 vote140 views1 answer
Alarm when code finishes
Python
0 vote145 views1 answer
Non blocking socket python
Python
0 vote136 views2 answers
Pandas remove repeated index
Python
5 votes140 views2 answers
Beautifulsoup find by class
Python
25 votes134 views6 answers
Python check for integer
Python
-2 votes135 views2 answers
Entered_text_1 = textbox_1.get(1.0, tk.END+"-1c")
Python
0 vote130 views1 answer
Remove emoji
Python

Share