Question: IN c++ *20.3 (Compute greatest common divisor using recursion) The gcd(m, n) can also be defined recursively as follows: if m% n is 0, gcd(m,
IN c++
*20.3 (Compute greatest common divisor using recursion) The gcd(m, n) can also be defined recursively as follows:
if m% n is 0, gcd(m, n) is n; Otherwise, gcd(m, n) is gcd(n, m % n).
Write a recursive method to find the GCD. Write a test program that prompts the user to enter two integers and displays their GCD.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
