/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 vote217 views1 answer
Color class android
Java
0 vote238 views2 answers
Programming scares me
Java
0 vote226 views1 answer
Android java how to blur an image
Java
0 vote232 views1 answer
Java run jar with args
Java
0 vote233 views1 answer
Java ArrayList toArray type mismatch
Java
0 vote244 views2 answers
Navigation view item selected
Java
0 vote231 views1 answer
WARN util.NativeCodeLoader: Unable to load native-hadoop library for your platform... using builtin-java classes where applicable
Java
0 vote239 views1 answer
Convert two bytes to int java
Java
0 vote250 views2 answers
How to send a byte array in socket java
Java
0 vote229 views1 answer
Setvisibility not working in fragment
Java