For this exercise, you will create several recursive functions in order to get a better understanding of how recursion works. In exercise 2, we will illustrate using recursion for creating art. Create a new project in IntelliJ called Recursion. Add a new Java class called Recursion with a public static main function. You will add several functions to your Recursion class as follows:1 Write a recursive function int sum(int n) that adds up the numbers from n to 1 and print your result. For example from main do the following: Recursion recursion = new Recursion();System.out.println(recursion.sum(6)); 1.2 Write a recursive function factorial(int n) that calculates the factorial of n. Print out the results. Add your function to your Recursion class. 1.3. Write a recursive function powerOf10(int n) that calculates 10n. 1.4. Write a more general recursive function powerOfN(int x, int p) that calculates the power of xp. Do not use the Math.pow function. 1.5. Write a function int bunnyEars(int n) that calculates the number of bunny ears for n bunnies. Bunnies have two ears.

Recursion is a process of calling the same function itself

Answered: Create a new project in IntelliJ called…

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

Concept explainers

Question

For this exercise, you will create several recursive functions in order to get a better understanding of how recursion works. In exercise 2, we will illustrate using recursion for creating art.

Create a new project in IntelliJ called Recursion. Add a new Java class called Recursion with a public static main function. You will add several functions to your Recursion class as follows:

1 Write a recursive function int sum(int n) that adds up the numbers from n to 1 and print your result. For example from main do the following:

Recursion recursion = new Recursion();
System.out.println(recursion.sum(6));

1.2 Write a recursive function factorial(int n) that calculates the factorial of n. Print out the results. Add your function to your Recursion class.

1.3. Write a recursive function powerOf10(int n) that calculates 10ⁿ.

1.4. Write a more general recursive function powerOfN(int x, int p) that calculates the power of x^p. Do not use the Math.pow function.

1.5. Write a function int bunnyEars(int n) that calculates the number of bunny ears for n bunnies. Bunnies have two ears.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 1 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