Question: Project 1 : The Greatest Common Divisor [GCD] Textbook Section : 7.36 Write in Java ** allow the user to enter 2 integers and the
Project 1: The Greatest Common Divisor [GCD] Textbook Section: 7.36
Write in Java
** allow the user to enter 2 integers and the program should output the gcd
Directions: Implement the Euclidean Algorithm to compute the greatest common divisor of any two integers. These two integers should be able to be positive, negative, zero, or any combination thereof. (Hint: be careful when dealing with zero and negative numbers.) Input: 2 integers Output: the gcd of the given integers
Extra Credit: Find the linear combination of the 2 given integers which sums to their gcd.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
