/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 vote271 views1 answer
How to convert timestamp to time in java
Java
0 vote190 views1 answer
Exception in Application start method java.lang.reflect.InvocationTargetException
Java
9 votes190 views1 answer
Difference between static and final in java
Java
3 votes185 views2 answers
Polar to cartesian java
Java
0 vote268 views1 answer
Binary to octal conversion java program
Java
10 votes178 views1 answer
Java read file text
Java
0 vote225 views1 answer
What went wrong: Execution failed for task ':app:processDebugMainManifest'. > Unable to make field private final java.lang.String java.io.File.path accessible: module java.base does not "opens java.io" to unnamed module @1ce90e66
Java
-1 vote144 views2 answers
Combox in java
Java
26 votes322 views2 answers
Java random numbers in specific range
Java
0 vote189 views1 answer
Document inserted succesfully but not present in the collection java
Java