/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

5 votes194 views2 answers
Jljjd;lja;ldkjalkddfjlkadf;laskjdfp9epifjeklfjkjwl2ODJwlkfndsopfksopjfsdifoasncdl cmk ]-0cd'f d
Java
5 votes182 views2 answers
Math.absolute java
Java
10 votes236 views2 answers
Change port in spring boot
Java Spring
163 votes274 views6 answers
Arrays
Java
2 votes171 views1 answer
Java random primary key
Java
0 vote198 views1 answer
How to convert arraylist to iterable in java
Java
1 vote178 views1 answer
Java class array of objects
Java
18 votes168 views6 answers
Java for
Java
-1 vote144 views1 answer
Adding element to the end of a linked list java
Java
4 votes240 views1 answer
Dependency for spring security
Java Spring