/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 vote355 views1 answer
Python request post with json with headers
Python
0 vote313 views1 answer
Creating venv on vscode linux
Python
43 votes342 views1 answer
Python liste alphabaet
Python
1 vote304 views1 answer
How to pip install pyttsx3
Python
0 vote322 views1 answer
Numpy diff
Python
1 vote306 views1 answer
Pandas row where value in list
Python
4 votes310 views3 answers
Python activate environment linux
Python
0 vote309 views2 answers
Generate random password django
Python
1 vote304 views1 answer
Intersection of dataframes based on column
Python
0 vote342 views1 answer
How to access a file from root folder in python project
Python

Share