/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 votes132 views1 answer
How to change a string array in integer array
Java
4 votes160 views1 answer
Int to double java
Java
0 vote136 views1 answer
Java replace nans with 0 csv line
Java
1 vote131 views1 answer
Highlight selected item in recyclerview android
Java
0 vote129 views1 answer
Mettre caractère de string en majuscule java
Java
0 vote134 views1 answer
Java dictionary initialization
Java
0 vote160 views1 answer
How to change fragment on button click navigation drawer
Java
0 vote131 views1 answer
Matlab leslie eigenvalue java
Java
0 vote135 views1 answer
Boolean parse jtextfield
Java
0 vote132 views1 answer
Welche Stoffeigenschaften kann man mit den Sinnesorganen wahrnehmen?
Java