/Java/Fibonacci series in java using recursion

Fibonacci series in java using recursion

class FibonacciExample2{  
 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   
 }  
}  

0 1 1 2 3 5 8 13 21 34

Source: javatpoint.com

Similar codes

0 vote142 views1 answer
Stack push java
Java
0 vote146 views1 answer
Java code for square
Java
0 vote157 views1 answer
Java enum from int
Java
0 vote143 views1 answer
How to add to a date in android
Java
0 vote158 views1 answer
Android view to bitmap
Java
-3 votes171 views2 answers
No enclosing instance of type Foo is accessible. Must qualify the allocation with an enclosing instance of type Foo (e.g. x.new A() where x is an instance of Foo
Java
0 vote138 views1 answer
Code to close dialog containg layout
Java
1 vote149 views1 answer
Java temp folder property
Java
5 votes150 views1 answer
How to get an array as input in java
Java
3 votes160 views1 answer
Java android studio int to string
Java