基本欧几里得算法的Python程序

# Python program to demonstrate Basic Euclidean Algorithm
  
  
# Function to return gcd of a and b
def gcd(a, b): 
    if a == 0 :
        return b 
      
    return gcd(b%a, a)
  
a = 10
b = 15
print("gcd(", a , "," , b, ") = ", gcd(a, b))
  
a = 35
b = 10
print("gcd(", a , "," , b, ") = ", gcd(a, b))
  
a = 31
b = 2
print("gcd(", a , "," , b, ") = ", gcd(a, b))
  
# Code Contributed By Mohit Gupta_OMG <(0_o)>

输出：

GCD(10, 15) = 5
GCD(35, 10) = 5
GCD(31, 2) = 1

时间复杂度： O(Log min(a, b))

有关详细信息，请参阅有关基本和扩展欧几里得算法的完整文章！