/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

2 votes193 views2 answers
Changer version java terminal
Java
0 vote186 views1 answer
Javax.ws.rs.core.response readentity not found
Java
2 votes194 views1 answer
Java getTime
Java
0 vote197 views1 answer
Spark write partitionby
Java
0 vote215 views1 answer
"https://unpkg.com/[email protected]/dist/ThaanaKeyboard.min.js
Java
-1 vote214 views1 answer
Schantalgebra
Java
4 votes197 views1 answer
Java how to get fps
Java
1 vote198 views2 answers
How to check if parsing in integer is possible in java
Java
0 vote190 views1 answer
How to calculate exponential in java
Java
4 votes191 views2 answers
Java random string
Java