/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 vote112 views1 answer
The options auto_now, auto_now_add, and defa ult are mutually exclusive. Only one of these options may be present.
Python
13 votes105 views5 answers
Pandas Set index
Python
3 votes142 views3 answers
Simple jwt django
Python Django
1 vote82 views1 answer
Jupyter clear output
Python
0 vote100 views1 answer
Find the median of input number in a list and print
Python
0 vote122 views1 answer
Read all the lines as a list in a file using the readlines() function
Python
18 votes139 views3 answers
Download pyautogui
Python
23 votes139 views4 answers
Pandas show all rows
Python
1 vote138 views1 answer
How to scroll by in selenium python
Python
2 votes135 views2 answers
Python exception element not found
Python

Share