| about | help | done | prefs | create account |
Java > 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) → 0 fibonacci(1) → 1 fibonacci(2) → 1 ...Save, Compile, Run See also Java Example Code. Java help docs: If Boolean Logic | Strings | While and For Loops | Arrays and Loops
|
Forget It! -- delete my code for this problem 309.0
Copyright Nick Parlante 2006-10 - privacy