/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 vote162 views1 answer
Change button background drawable in code Close
Java
0 vote145 views1 answer
Get logged-in user in Spring Security
Java Spring
3 votes117 views1 answer
How to check object type in java
Java
0 vote122 views1 answer
Rstudio boxplot coloring
Java
0 vote121 views1 answer
SPOJ Prime1
Java
0 vote99 views1 answer
Splitting text with several condition in java
Java
2 votes122 views1 answer
Java load image
Java
0 vote116 views1 answer
How to create a sublist in java
Java
2 votes116 views1 answer
Java number of days between dates
Java
0 vote130 views1 answer
Bfs java
Java