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.

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
icon
Related questions
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. 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.   

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Declaring and Defining the Function
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education