/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 vote344 views1 answer
Even and odd java &
Java
1 vote338 views1 answer
Play ringtone android in infinite loop
Java
0 vote335 views1 answer
AccountDriver.java
Java
0 vote317 views1 answer
Find out duplicate number between 1 to n numbers in java
Java
21 votes330 views5 answers
Android java string to double
Java
0 vote411 views3 answers
Diiferent ways to run spring boot
Java Spring
0 vote311 views1 answer
Mostrar divisores java
Java
0 vote312 views1 answer
How to save rich text format in database using java
Java
1 vote348 views1 answer
Jda embed message
Java
0 vote336 views1 answer
Menuitemcompat getactionview is deprecated in android
Java