program of fibonacci series with recursion without loop

This is java program to calculate fibonacci series with recursion. Always think alternatively as we can do this program easily using a loop. Every element in the fibonacci seires is addition of previous two elements. a[n]=a[n-1]+a[n-2] follow this rule to calculate whole series.




Program of  fibonacci series using Recursion in Java


import java.util.*;

public class FiboByRecursion {
public static void main(String args[]){
  
    Scanner s=new Scanner(System.in);
    System.out.println("Enter Number of Elements");
    int a=s.nextInt();
    for(int i=0;i<a;i++){
    System.out.println(doRecursion(i));
    }
}


public static int doRecursion(int a)
{
    if(a==0)
        return 0;    else if(a == 1)
        return 1;
    else
        return doRecursion(a-1)+doRecursion(a-2);
}
}