Broken down into practical pointers and step-by-step instructions, the IT Service Excellence Tool Kit delivers expert advice for technology solution providers. Get your free copy now.

Hi,

I am working on below challenge

http://codingbat.com/prob/p183649

please advise

I am working on below challenge

http://codingbat.com/prob/p183649

I am not clear on above desription. what it mean by computing recursively?

We have a number of bunnies and each bunny has two big floppy ears. We want to compute thetotal number of ears across all the bunnies recursively (without loops or multiplication).

bunnyEars(0) → 0

bunnyEars(1) → 2

bunnyEars(2) → 4

please advise

The idea of calling one function from another immediately suggests the possibility of a function calling itself. The function-call mechanism in Java supports this possibility, which is known as recursion.

Your first recursive program. The "Hello, World" for recursion is the factorial function, which is defined for positive integers n by the equation

n!=n×(n−1)×(n−2)×…×2×1

n!=n×(n−1)×(n−2)×…×2×1

The quantity n! is easy to compute with a for loop, but an even easier method in Factorial.java is to use the following recursive function:

public static long factorial(int n) {

if (n == 1) return 1;

return n * factorial(n-1);

}

We can trace this computation in precisely the same way that we trace any sequence of function calls.

factorial(5)

factorial(4)

factorial(3)

factorial(2)

factorial(1)

return 1

return 2*1 = 2

return 3*2 = 6

return 4*6 = 24

return 5*24 = 120

i am reading from below link

http://introcs.cs.princeton.edu/java/23recursion/

Eg.

Explanation of recursion

An introduction to recursion

1. if o bunnies return ears 0;

2. if one bunny ears 0 i.e 2+bunnyEars(1-1)

3. if n bunnies 2+bunneyEars(n-1)

Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.

All Courses

From novice to tech pro — start learning today.