/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 vote228 views1 answer
Does constructor return any value java
Java
2 votes247 views2 answers
Zufallszahl java
Java
0 vote244 views1 answer
Get intersection of two lists java
Java
0 vote262 views2 answers
Java exception list
Java
0 vote221 views1 answer
IsEmpty java code
Java
0 vote237 views1 answer
Java remove List null element
Java
0 vote258 views1 answer
Void setup
Java
0 vote236 views1 answer
Usaco 2018 january contest
Java
0 vote248 views1 answer
Spring boot save file to static folder
Java
0 vote235 views1 answer
How to make arraylist character
Java