1. Create a class called EuclideanAlgorithm. 2. Create the main method inside the EuclideanAlgorithm class. 3. Inside the main method, create the following variables: a. Declare and initialize an int named num1 with any integer in the range [1, 1000] of your choice. b. Declare and initialize an int named num2 with any integer in the range [1, 1000] of your choice. c. Declare an int named steps and initialize it a value of 0. d. Declare an int named dividend and initialize it to the value of num1 (do not hardcode using the literal value). e. Declare an int named divisor and initialize it to the value of num2 (do not hardcode using the literal value). f. Declare an int named gcd. g. Declare an int named quotient. h. Declare an int named remainder. 4. Using printf with appropriate format specifiers, print the following on its own line: Finding the greatest common divisor of {num1} and {num2}. 5. Using an if-else statement: a. If divisor is greater than dividend: i. Print the following on its own line: The inputs would have caused an unnecessary step. ii. Swap the values of divisor and dividend. b. Otherwise: i. Print: An extra step was avoided. 6. Within a do-while loop, perform the following steps while remainder is not equal to zero: a. Increment steps. b. Assign dividend / divisor to quotient. c. Assign the remainder of dividend / divisor to remainder. d. Using printf with appropriate format specifiers, print the following on its own line: Step {steps}: {dividend} = {divisor} * {quotient} + {remainder} e. Update gcd to the value of divisor. f. Update dividend to the value of divisor. g. Update divisor to the value of remainder. 8. Using a switch statement, print one of the following statements on its own line depending on the value of steps: a. 1: Only one step was needed! b. 2: Two steps were taken! c. 3: This process took three steps. d. 4: Wow! Four steps. e. In all other cases: (steps} steps is a lot of steps! 9. Using a ternary expression (?:) and printf, print one of the following statements on its own line depending on whether num1 and num2 are relatively prime: a. If num1 and num2 are relatively prime: i. {num1} and {num2} are relatively prime. b. Otherwise: i. {num1} and {num2} are not relatively prime.

1. Create a class called EuclideanAlgorithm. 2. Create the main method inside the EuclideanAlgorithm class. 3. Inside the main method, create the following variables: a. Declare and initialize an int named num1 with any integer in the range [1, 1000] of your choice. b. Declare and initialize an int named num2 with any integer in the range [1, 1000] of your choice. c. Declare an int named steps and initialize it a value of 0. d. Declare an int named dividend and initialize it to the value of num1 (do not hardcode using the literal value). e. Declare an int named divisor and initialize it to the value of num2 (do not hardcode using the literal value). f. Declare an int named gcd. g. Declare an int named quotient. h. Declare an int named remainder. 4. Using printf with appropriate format specifiers, print the following on its own line: Finding the greatest common divisor of {num1} and {num2}. 5. Using an if-else statement: a. If divisor is greater than dividend: i. Print the following on its own line: The inputs would have caused an unnecessary step. ii. Swap the values of divisor and dividend. b. Otherwise: i. Print: An extra step was avoided. 6. Within a do-while loop, perform the following steps while remainder is not equal to zero: a. Increment steps. b. Assign dividend / divisor to quotient. c. Assign the remainder of dividend / divisor to remainder. d. Using printf with appropriate format specifiers, print the following on its own line: Step {steps}: {dividend} = {divisor} * {quotient} + {remainder} e. Update gcd to the value of divisor. f. Update dividend to the value of divisor. g. Update divisor to the value of remainder. 8. Using a switch statement, print one of the following statements on its own line depending on the value of steps: a. 1: Only one step was needed! b. 2: Two steps were taken! c. 3: This process took three steps. d. 4: Wow! Four steps. e. In all other cases: (steps} steps is a lot of steps! 9. Using a ternary expression (?:) and printf, print one of the following statements on its own line depending on whether num1 and num2 are relatively prime: a. If num1 and num2 are relatively prime: i. {num1} and {num2} are relatively prime. b. Otherwise: i. {num1} and {num2} are not relatively prime.

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter8: Arrays

Section: Chapter Questions

Problem 2CP

See similar textbooks