/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 vote241 views1 answer
Python split input to list
Python
0 vote204 views1 answer
Py2exe no console
Python
1 vote214 views2 answers
Write hexadecimal in python
Python
0 vote189 views1 answer
Python scheduler
Python
-2 votes192 views2 answers
Entered_text_1 = textbox_1.get(1.0, tk.END+"-1c")
Python
1 vote202 views1 answer
Can you print to multiple output files python
Python
5 votes190 views1 answer
Python close input timeout
Python
0 vote180 views1 answer
Permission denied when converting dataframe to csv
Python
0 vote195 views1 answer
Python how to add picture to label with tkinter
Python
0 vote189 views1 answer
Undef variable
Python

Share