/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

7 votes344 views1 answer
Convert string to localdatetime
Java
0 vote349 views1 answer
Java page setup
Java
0 vote328 views1 answer
Java stream map int to char
Java
0 vote335 views1 answer
Final vs static keyword in java
Java
0 vote342 views1 answer
Show all spring boot beans
Java Spring
2 votes291 views1 answer
Primefaces custom validator
Java
0 vote310 views1 answer
OCA Exam Questions
Java
0 vote295 views1 answer
Change brightness of image in java
Java
3 votes305 views2 answers
Java vs python
Java
9 votes316 views2 answers
How to convert int into int array of digits in java
Java