/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 vote149 views1 answer
Para que sirve getcontentpane en java
Java
0 vote142 views1 answer
Spigot disable health regeneration
Java
0 vote135 views1 answer
Select photo from camera android
Java
0 vote117 views1 answer
How to sort 2d array in java using stream api
Java
0 vote134 views1 answer
équivalent setTimeInterval java
Java
1 vote154 views1 answer
Java \n
Java
0 vote154 views1 answer
Bad notification for startForeground: java.lang.RuntimeException: invalid channel for service notification: Notification
Java
3 votes141 views1 answer
More than one file was found with OS independent path 'META-INF/metadata.jvm.kotlin_module'
Java
1 vote140 views1 answer
Get value google sheet with app script
Java
0 vote164 views1 answer
Java tcp readline not working
Java