http://s8.postimage.org/5c75un3qt/JAVAAA.jpg Solution public class GCD { public

Question

Explanation / Answer

public class GCD { public static void main(String[] args) { System.out.println("Greatest Common Divisor Finder"); System.out.println(); String choice = "y"; Scanner sc = new Scanner(System.in); while (choice.equalsIgnoreCase("y")) { System.out.print("Enter first number: "); double first; first = sc.nextDouble(); System.out.print("Enter second number: "); double second; second = sc.nextDouble(); if (first>second) { int subtract; do { subtract = (int)first- (int)second; } while (first>second); int gcd; gcd = (int)second - subtract; System.out.println("Greatest Common Divisor: " gcd); } else { int subtract; do { subtract = (int)second - (int)first; } while(second>first); int gcd; gcd = (int)first - subtract; System.out.println("Greatest Common Divisor: " gcd); } System.out.println(); System.out.print("Continue? (y/n): "); choice = sc.next(); System.out.println(); } } }

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.