/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 vote394 views1 answer
Java linked list swap elements
Java
0 vote371 views1 answer
Hystrix configuration spring boot
Java
0 vote349 views1 answer
Greatest of three in java
Java
1 vote352 views1 answer
How to have multiple extensions in one filter java
Java
2 votes343 views1 answer
Primefaces custom validator
Java
0 vote369 views1 answer
Day of week integer to name of day in java
Java
46 votes370 views6 answers
How to get last element of array java
Java
0 vote371 views1 answer
How to take array as an argument in java
Java
0 vote443 views1 answer
Get logged-in user in Spring Security
Java Spring
1 vote372 views1 answer
Boolean java.lang.String.equals(java.lang.Object)' on a null object reference
Java