Question: solve the question in python 4. Write a recursive function to calculate the greatest common divisor of two integers. Name the function gcd(x,y). For example,
4. Write a recursive function to calculate the greatest common divisor of two integers. Name the function gcd(x,y). For example, gcd(48,18) returns 6. Hint: Use the Euclidean algorithm for finding gcd
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
