fibonocci number in java

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
public int fibonacci(int n) {


if(n==0)

return 0;

else if (n == 1)

return 1;

else if (n == 2)

return 1;

else

return fibonacci(n-1) + fibonacci(n-2);

}

Comments

Popular posts from this blog

defining functions clojure

How to retain the space of the td after hidding it in Jquery

Integrating Struts2 with Spring Security using Custom Login Form