/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

3 votes134 views1 answer
How many ways we can do exception handling in java
Java
1 vote117 views1 answer
Textarea user select disable java swing
Java
1 vote143 views3 answers
Get app version android
Java
1 vote152 views1 answer
Remove duplicates from arraylist in android
Java
0 vote138 views1 answer
Capture console output java
Java
11 votes135 views1 answer
Java make sure only one condition is true
Java
2 votes143 views1 answer
Java convert bytes to string
Java
1 vote133 views1 answer
String joiner in streams java
Java
2 votes136 views1 answer
How to change a string array in integer array
Java
0 vote135 views1 answer
Matlab leslie eigenvalue java
Java