/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 vote189 views1 answer
Python string to list without split
Python
0 vote198 views1 answer
Locust python use of between
Python
2 votes148 views1 answer
Dataframe to list
Python
2 votes195 views1 answer
Python read text file look for string
Python
6 votes175 views3 answers
Python timestamp
Python
1 vote178 views1 answer
Python string format_map
Python
16 votes150 views8 answers
Curl in python
Python
1 vote196 views2 answers
Dataframe all companies except
Python
9 votes180 views3 answers
SettingWithCopyWarning: A value is trying to be set on a copy of a slice from a DataFrame. Try using .loc[row_indexer,col_indexer] = value instead
Python
14 votes184 views2 answers
Fastapi authentication
Python

Share