/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 vote267 views1 answer
Verificar numero par ou impar jacva
Java
0 vote299 views1 answer
SwipeRefreshLayout
Java
10 votes311 views6 answers
Toast in android kotlin
Java
-2 votes333 views2 answers
No enclosing instance of type Foo is accessible. Must qualify the allocation with an enclosing instance of type Foo (e.g. x.new A() where x is an instance of Foo
Java
1 vote355 views1 answer
Spring mvc project example
Java
2 votes338 views2 answers
How to convert date to dd-mon-yyyy format in java
Java
2 votes333 views2 answers
Java popup message
Java
3 votes315 views5 answers
Declare variable java
Java
0 vote334 views1 answer
Plus one leetcode
Java
0 vote327 views1 answer
Java access attribute of object in arraylist
Java