/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 vote147 views2 answers
Android studio clear child views
Java
2 votes120 views2 answers
Android java transparent background
Java
0 vote196 views1 answer
Spring boot maven run with profile
Java
0 vote153 views1 answer
Java exponencial
Java
0 vote266 views1 answer
List class type java
Java
0 vote124 views1 answer
Java konsolenausgabe
Java
0 vote134 views1 answer
Java program to find the sum of first 100 numbers
Java
16 votes143 views4 answers
Reverse array in java
Java
21 votes131 views2 answers
How to loop through arraylist of objects in java
Java
0 vote131 views1 answer
Localdatetimw java input
Java