human
Program to find GCD or HCF of two numbers | Recursive function to return gcd of a and b.
Everything divides 0.
base case.
a is greater.
Driver program to test above function"
Solution in Python:
assistant
#Here is code to program to find GCD or HCF of two numbers and the other steps required.
 def gcd ( a , b ) :
	if ( a == 0 ) :
		return b
	if ( b == 0 ) :
		return a
	if ( a == b ) :
		return a
	if ( a > b ) :
		return gcd ( a - b , b )
	return gcd ( a , b - a )
a = 98
b = 56
if ( gcd ( a , b ) ) :
	print ( ' GCD ▁ of ' , a , ' and ' , b , ' is ' , gcd ( a , b ) )
else :
	print ( ' not ▁ found ' )