/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 vote146 views1 answer
Matplotlib FiveThirtyEight horizontal graph
Python
0 vote153 views1 answer
Dict keys
Python
0 vote142 views1 answer
Scatter matrix plot
Python
0 vote177 views1 answer
Python send image in post request with json data
Python
0 vote167 views1 answer
Python word cloud
Python
0 vote137 views1 answer
Import re #your code goes here number=input() pattern=r"(1|8|9)[0-9]+" match=re.match(pattern,number) of lane(number)==8: if(match): print("value") else: print("invalid") else print("invalid")
Python
0 vote139 views1 answer
ValueError: Invalid format specifier
Python
0 vote142 views1 answer
Use miraculous with enviroment variable token
Python
0 vote147 views1 answer
Simple example of printing a C version of a SymPy expression:
Python
2 votes144 views2 answers
Python how to get script directory
Python

Share