/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 vote118 views1 answer
'toByteArray(java.io.Reader)' is deprecated
Java
1 vote136 views1 answer
How to print two variables in same line in java
Java
4 votes108 views3 answers
Java get number of days in month
Java
0 vote114 views1 answer
Random item from arraylist
Java
10 votes112 views4 answers
How to find sha key in android studio
Java
-1 vote137 views2 answers
How to use spring in java
Java Spring
-1 vote112 views1 answer
Convert Date to LocalDate via Instant
Java
0 vote108 views1 answer
Java break string at comma
Java
0 vote137 views1 answer
Could not determine java version from
Java
6 votes99 views2 answers
Continue in java
Java