/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

1 vote89 views1 answer
Get the last Friday of a month in Java
Java
2 votes105 views3 answers
Java tomorrow date
Java
0 vote109 views1 answer
Exception in Application start method java.lang.reflect.InvocationTargetException
Java
0 vote97 views2 answers
Java map to list or array
Java
11 votes106 views3 answers
Java read lines from file
Java
0 vote93 views1 answer
Google pass api integration in java
Java
2 votes103 views1 answer
Android translate string java
Java
0 vote122 views1 answer
Diamonds
Java
0 vote109 views1 answer
What is static setter and getter examples in java
Java
0 vote95 views1 answer
Spring filter exception handling
Java