id/email password forgot password | create account
 about | help | code help+videos | done | prefs
CodingBat code practice

Recursion-1 > fibonacci
prev  |  next  |  chance

 The fibonacci sequence is a famous bit of mathematics, and it happens to have a recursive definition. The first two values in the sequence are 0 and 1 (essentially 2 base cases). Each subsequent value is the sum of the previous two values, so the whole sequence is: 0, 1, 1, 2, 3, 5, 8, 13, 21 and so on. Define a recursive fibonacci(n) method that returns the nth fibonacci number, with n=0 representing the start of the sequence.fibonacci(0) → 0fibonacci(1) → 1fibonacci(2) → 1...Save, Compile, Run (ctrl-enter)public int fibonacci(int n) { } Editor font size %:75100125150Shorter output

Forget It! -- delete my code for this problem

Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph

### Misc Code Practice

Difficulty: 309.0

Copyright Nick Parlante 2017 - privacy