Q. Python Program to Find Gcd of Two Numbers.
Here you will find an algorithm and program in Python programming language to find GCD of two numbers. First let us understand what is GCD.
Explanation : GCD stands for Greatest Common Divisor, GCD of two numbers is the largest number that can exactly divide both numbers. It is also called as HCF.
For Example : GCD of 60 and 45 is 15. 15 is the greatest number which can divide both 60 and 45. Therefore GCD of 60 and 45 is 15.
Algorithm to find GCD of two numbers
START 1. Input 2 Numbers A and B and declare variable GCD which holds the result. 2. Run Loop i from 1 to i <= A and i <=B Check if A & B are completely divisible by i or not if yes then Assign GCD = i Loop End 3. Output GCD STOP
Python Program to Find Gcd of Two Numbers
def find_gcd(num1, num2): if num1 > num2: smaller = num2 else: smaller = num1 for i in range(1, smaller+1): if((num1 % i == 0) and (num2 % i == 0)): gcd = i return gcd num1 = 60 num2 = 45 gcd=find_gcd(num1, num2) print ("G.C.D. of ", num1, " and ", num2, " is ", gcd)
GCD of 60 and 45 is 15