/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 vote294 views1 answer
How to install java 8 on terminal os
Java
0 vote262 views1 answer
Error declaring float variable in java
Java
1 vote271 views3 answers
Recursion examples Java
Java
1 vote302 views1 answer
Unsupported Modules Detected
Java
0 vote266 views1 answer
Why enable multidex android
Java
0 vote300 views1 answer
Running time of java program
Java
0 vote254 views1 answer
There is no client authentication. Try adding an appropriate authentication filter
Java
12 votes296 views3 answers
Hash map java
Java
1 vote292 views1 answer
Shakescleare merchant of venice
Java
10 votes263 views1 answer
Intent android open activity
Java