/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

0 vote305 views1 answer
How to draw a square pygame
Python
1 vote351 views1 answer
How to code a clickable button in python
Python
20 votes323 views2 answers
Cv2 not found
Python
0 vote311 views1 answer
Pls work
Python
3 votes315 views3 answers
Pandas convert series of datetime to date
Python
41 votes315 views6 answers
Replace nan in pandas
Python
3 votes336 views1 answer
Creating a virtual environment in python 3.8
Python
4 votes306 views3 answers
Python activate environment linux
Python
1 vote344 views1 answer
Program to segregate positive and negative numbers in same list
Python
0 vote345 views1 answer
How do i re-restablish the third reich
Python

Share