/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 vote176 views1 answer
Icon label java
Java
8 votes208 views1 answer
How to see java version in windows 10
Java
0 vote199 views1 answer
Down casting java
Java
2 votes188 views1 answer
Java random unique key
Java
0 vote166 views1 answer
2d matrix multiplication
Java
1 vote257 views1 answer
How to refresh activity without intent in android
Java
0 vote183 views1 answer
Java swing place objects vertically
Java
6 votes201 views2 answers
Check type of variable java
Java
1 vote164 views1 answer
How to read file from assets folder in android
Java
0 vote207 views1 answer
How to use another class in java inside of an action listenrer
Java