Question: Write a Java program to recursively calculate the greatest common divisor (GCD) of two integers. In this (console) program you will ask the user to

Write a Java program to recursively calculate the greatest common divisor (GCD) of two integers. In this (console) program you will ask the user to enter 2 integers. The program will calculate the GCD of the two integers and show it on the console. This must be done using a RECURSIVE method.

The GCD of x and y is defined as follows: If y is equal to zero GCD(x,y) is x. Otherwise GCD(x,y) is GCD(y, x%y), where % is the Modulo Operator.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!