Sami Ullah samiullah-dev
samiullah-dev
/ problems'SolutionOfWeekTwo
Last active
April 23, 2019 02:52
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Q1. 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 | |
| bunnyEars(234) → 468 | |
| ________________________________________________________________________________________________________________________________________ | |
| package projects; | |
| import java.util.*; | |
| public class FloppyEars { |