Fibonacci series

public class FibonacciCalc
{
    public static int fibonacciRecursion(int n)
    {
    if(n == 0){
        return 0;
    }
    if(n == 1 || n == 2){
        return 1;
       }
    return fibonacciRecursion(n-2) + fibonacciRecursion(n-1);
    }
    public static void main(String args[]) 
    {
        int maxNumber = 10;
    System.out.println("Fibonacci Series of "+maxNumber+" numbers: ");
    for(int i = 0; i < maxNumber; i++){
        System.out.print(fibonacciRecursion(i) +" ");
       }
    }
}
This entry was posted in recursion. Bookmark the permalink.

Leave a Reply

Your email address will not be published. Required fields are marked *