/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 vote282 views1 answer
Pandas previous row
Python
0 vote275 views1 answer
Python get website chrome network tab
Python
5 votes326 views1 answer
Write multiple df to excel pandas
Python
0 vote296 views1 answer
Python file hashlib
Python
0 vote317 views1 answer
Flask new response style with `make_response`
Python
0 vote300 views3 answers
Python with quick sort
Python
1 vote310 views1 answer
Series to numpy array
Python
8 votes309 views3 answers
How to maximize pandas output python
Python
0 vote299 views1 answer
Distplot for 2 columns
Python
1 vote312 views2 answers
How to add list as new row to pandas dataframe
Python

Share