/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

1 vote159 views1 answer
Add value with n variable with Arraylist in java
Java
0 vote168 views1 answer
Java enum from int
Java
1 vote170 views1 answer
Filter arraylist java
Java
0 vote170 views1 answer
What are construtcor java
Java
3 votes163 views1 answer
Java load .json file
Java
7 votes159 views1 answer
How to reverse order of arraylist
Java
0 vote179 views1 answer
Android access main toolbar in fragment
Java
1 vote177 views1 answer
Not supported for DML operations
Java
0 vote175 views1 answer
Java thyemleaf save table form to database
Java
0 vote167 views1 answer
Mambalam srardham online booking
Java