/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

-2 votes171 views1 answer
Android studio remove navigation bar
Java
0 vote155 views1 answer
Hide steam games from friends
Java
1 vote161 views1 answer
New int [] in java with assigned values
Java
0 vote192 views2 answers
Number format java
Java
2 votes174 views1 answer
Java text ouput to console
Java
0 vote190 views1 answer
Spring Security JWT Authentication + PostgreSQL – RestAPIs SpringBoot + Spring MVC + Spring JPA
Java Spring
0 vote183 views2 answers
Convert void * to int
Java
1 vote167 views1 answer
Complicated average java code
Java
0 vote211 views1 answer
Current time in long java
Java
0 vote165 views1 answer
Bebra
Java