Question: USE C+ LANGUAGE ONLY Q1. Write a recursive program to find the GCD of x and y where x,y are positive integers using the following
USE C+ LANGUAGE ONLY
Q1. Write a recursive program to find the GCD of x and y where x,y are positive integers using the following technique. Write a main function to take the input from the user. For example, to compute gcd(48,18), the computation is as follows: gcd(48,18)gcd(18,48mod18)=gcd(18,12)gcd(12,18mod12)=gcd(12,6)gcd(6,12mod6)=gcd(6,0)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
