Python Program for Basic Euclidean algorithms
# 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 = 10b = 15print("gcd(", a , "," , b, ") = ", gcd(a, b)) a = 35b = 10print("gcd(", a , "," , b, ") = ", gcd(a, b)) a = 31b = 2print("gcd(", a , "," , b, ") = ", gcd(a, b)) # |
chevron_right
filter_none
Output:
GCD(10, 15) = 5 GCD(35, 10) = 5 GCD(31, 2) = 1
Time Complexity: O(Log min(a, b))