Program to print Fibonacci series using Recursion.

Explanation :
In Fibonacci series, next number is the sum of previous two numbers.
For example: If count =10 then output will be 0, 1, 1, 2, 3, 5, 8, 13, 21, 34.
Recursion means calling a method within itself until it returns a value.

Code:

public class Fibonacci
{ 
    static int n1=0,n2=1,n3=0;   
    static void printFibonacci(int count)
   {   
        if(count>0)
       {   
         n3 = n1 + n2;   
         n1 = n2;   
         n2 = n3;   
         System.out.print(" "+n3);  
         printFibonacci(count-1);   
       }   
    }   
    public static void main(String args[])
   {   
      int count=10;   
      System.out.print(n1+" "+n2);//printing 0 and 1   
      printFibonacci(count-2);//n-2 because 2 numbers are already printed  
    } 
}

Program to print Fibonacci Series till a given range.

Explanation :
In Fibonacci series, next number is the sum of previous two numbers.
For example: If count =10 then output will be 0, 1, 1, 2, 3, 5, 8, 13, 21, 34.

Code:

public class Fibonacci
{
    public static void main(String args[ ])
   {
       Scanner sc= new Scanner(System.in);  
       int n1=0,n2=1,n3,i;
       count = sc.nextInt();  
       System.out.print(n1+" "+n2);//printing 0 and 1  
  
       for(i=2;i<count;++i)  
       {  
            n3=n1+n2;  
            System.out.print(" "+n3);  
            n1=n2;  
            n2=n3;  
         }  
     }
}