Question: 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)
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
3.45 Rating (155 Votes )
There are 3 Steps involved in it
The Method definition to find the GCD is as follows public static long findGCDlong m long n The meth... View full answer
Get step-by-step solutions from verified subject matter experts
