use JAVA to write the code. : Euclid’s algorithm for finding the greatest common divisor (gdc) of two numbersThe algorithm: given two numbers, n1 and n2:Divide n1 by n2 and let r be the remainder.If the remainder r is 0, the algorithm is finished and the answer is n2. (If the remainder is 1, the numbers are mutually prime and we are done-see below.)Set n1 to the value of n2, set n2 to the value of r, and go back to step 1.Entering 0 for one of the values is bad. It should work for the other value, but you have to figure out which is OK and which is bad.Catch this problem as it happens and make the user enter another value until they enter an acceptable one.Give an appropriate error message if this happens.

Program description: Java program that prompts user to enter the values for n1 and n2 .Then check if…

Answered: JAVA to write the code. : Euclid’s…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

use JAVA to write the code.

: Euclid’s algorithm for finding the greatest common divisor (gdc) of two numbers

The algorithm: given two numbers, n1 and n2:

Divide n1 by n2 and let r be the remainder.
If the remainder r is 0, the algorithm is finished and the answer is n2. (If the remainder is 1, the numbers are mutually prime and we are done-see below.)
Set n1 to the value of n2, set n2 to the value of r, and go back to step 1.

Entering 0 for one of the values is bad. It should work for the other value, but you have to figure out which is OK and which is bad.

Catch this problem as it happens and make the user enter another value until they enter an acceptable one.
Give an appropriate error message if this happens.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions