/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 vote268 views1 answer
Find out duplicate number between 1 to n numbers in java
Java
0 vote273 views1 answer
Aabb collision java
Java
0 vote277 views1 answer
Uri/Beecrowd problem no - 1150 solution in Java
Java
0 vote262 views1 answer
Antlr missing argument for lexer command 'channel'
Java
0 vote274 views1 answer
Loop will array length java example
Java
0 vote299 views1 answer
Android:windowLightStatusBar programmatically
Java
0 vote274 views1 answer
Redshift establish connection jav gradle
Java
2 votes274 views2 answers
Button event
Java
1 vote280 views1 answer
Gradle reflections
Java
0 vote275 views1 answer
Add pd4j to application
Java