Sum the digits in an integer using recursion Program plan: Import required packages. Declare the main class named “Main”. Give the main method “public static void main ()”. Create an object “sc” for the scanner class. Get a number and store it in a variable “num”. Print the sum of the digits by calling the function “sumDigits ()”. Give function definition for the static method “sumDigits ()”. Declare a variable “sum” and assign 0 to it. Check if the value of “n” is not equal to 0. Call the function “sumDigits ()” recursively to calculate the sum of digits. Return the variable “sum”.

Question

Want to see the full answer?

Answer 1

Question

Chapter 18, Problem 18.11PE

Program Plan Intro

Sum the digits in an integer using recursion

Program plan:

Import required packages.

Declare the main class named “Main”.

Give the main method “public static void main ()”.

Create an object “sc” for the scanner class.

Get a number and store it in a variable “num”.

Print the sum of the digits by calling the function “sumDigits ()”.

Give function definition for the static method “sumDigits ()”.

Declare a variable “sum” and assign 0 to it.

Check if the value of “n” is not equal to 0.

Call the function “sumDigits ()” recursively to calculate the sum of digits.

Return the variable “sum”.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Recursive Power MethodWrite a method called powCal that uses recursion to raise a number to a power. The method should accept two arguments: The first argument is the exponent and the second argument is the number to be raised (example” powCal(10,2) means 210). Assume that the exponent is a nonnegative integer. Demonstrate the method in a program called Recursive (This means that you need to write a program that has at least two methods: main and powCal. The powCal method is where you implement the requirements above and the main method is where you make a method call to demonstrate how your powCal method work).

Java Program: Recursive Method There are n people in a room where n is an integer greater then or equal to 2. Each person shakes hands once with every other person. What is the total number of handshakes in the room? Write a recursive method to solve this problem with the following header:public static int handshake(int n)where handshake(n) returns the total number of handshakes for n people in the room. To get you started if there are only one or two people in the room, then:handshake(1)=0handshake(2)=1

42) Look at the following method: public static int test2 (int x, int y) if (x < y) { return -5; } else { return (test2 (x - y, y + 5) + 6) ; } } What is returned for test2 (10, 20)? A) -5 B) 1 C) 6 D) 10 43) This term is used for methods that directly call themselves. A) Simple recursion C) Absolute recursion B) Direct recursion D) Native recursion 44) If the base case in a recursive method is never reached: A) The result will always be off by one. C) The method will call itself indefinitely. B) The method will call itself only once. D) The method will never call itself. 45) A(n) is an object that is generated in memory as the result of an error or an unexpected event. A) exception C) default exception handler B) exception handler D) error message 46) All of the exceptions that you will handle are instances of classes that extend this class. A) Exception C) IOException B) RunTimeException D) Error 47) All exceptions are instances of dasses that extend this class. A) Throwable C)…