/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 vote296 views1 answer
Type of tuple in python
Python
0 vote289 views1 answer
Tkinter centre a button on 1920x1080
Python
0 vote343 views1 answer
Search bar python program
Python
0 vote296 views1 answer
Even numbers from 1 to 100 in python
Python
45 votes247 views6 answers
Python check if list contains
Python
0 vote263 views1 answer
Plt.tight_layout()
Python
96 votes304 views6 answers
Read json file
Python
1 vote299 views2 answers
Selenium webdriver scroll down python
Python
0 vote300 views1 answer
Python pandas convert comma separated number string to integer list
Python
0 vote292 views1 answer
Copy multiple files from one folder to another folder
Python

Share