/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

103 votes397 views6 answers
Java hello world program
Java
1 vote290 views1 answer
Java.lang.classnotfoundexception: org.mariadb.jdbc.driver
Java
0 vote306 views1 answer
Spring boot MVC config
Java
1 vote342 views6 answers
Convert code from kotlin to java
Java
-2 votes331 views2 answers
Java get filename without extension
Java
0 vote300 views1 answer
How to convert timestamp to time in java
Java
0 vote278 views1 answer
Android java buttons
Java
4 votes300 views2 answers
Android parse date
Java
0 vote300 views1 answer
Hanoï recursive algorithm
Java
0 vote302 views1 answer
Spring security default username
Java