Recursion-1 > bunnyEars
prev  |  next  |  chance

We have a number of bunnies and each bunny has two big floppy ears. We want to compute the total number of ears across all the bunnies recursively (without loops or multiplication). bunnyEars(0) → 0 bunnyEars(1) → 2 bunnyEars(2) → 4 ...Save, Compile, Run          Show Hint Show Solution public int bunnyEars(int bunnies) { } See Also: Example Code Java help: If Boolean Logic | Strings | While and For Loops | Arrays and Loops prev  |  next  |  chance   |  JavaBat  >  Recursion-1

Forget It! -- delete my code for this problem 306.0

Copyright Nick Parlante 2006-09 - privacy