fibonacci series solve from java

A series of numbers in which each number is the sum of the two preceding numbers .
this series is called a Fibonacci number series and that number is fibonacci number.
as like 1,1,2,3,5,8,..
we solve this problem from java program it code look like this.

Fibonacci Series using recursion in java

Let's see the fibonacci series program in java using recursion.

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
package javasample;

/**
 *
 * @author rajesh kumar shukla
 */
public class BigFibb {
 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   
 }  
}  
out purt of this programs
0 1 1 2 3 5 8 13 21 34BUILD SUCCESSFUL (total time: 0 seconds)


Fibonacci Series in Java without using recursion

Let's see the fibonacci series program in java without using recursion.

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
package javasample;

/**
 *
 * @author rajesh kumar shukla
 */
public class FibonacciExam {
    public static void main(String args[])  
{    
 int n1=0,n2=1,n3,i,count=10;    
 System.out.print(n1+" "+n2);//printing 0 and 1    
    
 for(i=2;i<count;++i)//loop starts from 2 because 0 and 1 are already printed    
 {    
  n3=n1+n2;    
  System.out.print(" "+n3);    
  n1=n2;    
  n2=n3;    
 }    
  
}
}

ouput of this program
0 1 1 2 3 5 8 13 21 34BUILD SUCCESSFUL (total time: 0 seconds)