/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 vote262 views1 answer
Adding column to CSV Dictreader
Python
0 vote257 views1 answer
Sort list in python by substring
Python
0 vote253 views1 answer
Python random real
Python
-2 votes269 views4 answers
DFS
Python
0 vote294 views1 answer
ImportError: cannot import name 'dedent' from 'matplotlib.cbook'
Python
1 vote262 views1 answer
Db_index django
Python
19 votes263 views4 answers
How to use python to sleep if the user is not using the system
Python
0 vote263 views1 answer
Copy a df to another df
Python
11 votes260 views2 answers
Select rows with multiple conditions pandas query
Python
0 vote240 views1 answer
Python list clear vs del
Python

Share