/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 vote352 views1 answer
Java 8 list to map with occurrences
Java
2 votes331 views1 answer
Primefaces datepicker custom validation
Java
0 vote332 views2 answers
Spring boot base url
Java
2 votes340 views1 answer
Jenkins decrypt password script console
Java
1 vote337 views1 answer
Java connect mariadb
Java
0 vote326 views1 answer
Check folder for files java
Java
1 vote368 views1 answer
How to write deserlizer java
Java
1 vote370 views2 answers
Get distinct values from list of objects java
Java
1 vote351 views1 answer
Square root in java using binary search
Java
0 vote337 views1 answer
EXPECTTIONS JAVA
Java