/Python/Euclid algorithm

Euclid 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 algorithm

 function mcd($a,$b) {
	while($b) list($a,$b)=array($b,$a%$b);
	return $a;
}

0

Euclid's algorithm

def GCF(a,b):
  if a == b: return a
  else: return GCF(abs(a-b), min(a,b))

0

Euclid algorithm

def MCD(a,b):
    while b != 0:
        a, b = b, a % b
    return a

0

Similar codes

4 votes290 views2 answers
Count characters in string python
Python
5 votes264 views2 answers
Python link shortener
Python
90 votes283 views6 answers
Python get current directory
Python
0 vote247 views1 answer
Download button image streamlit
Python
2 votes254 views1 answer
Python ftplib get list of directories
Python
5 votes266 views3 answers
How to add images in hml while using flask
Python
24 votes285 views6 answers
Static files in django
Python
2 votes245 views3 answers
Make button in tk
Python
125 votes274 views6 answers
Dataframe rename column
Python
2 votes268 views2 answers
Python find second occurrence in string
Python

Share