/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

6 votes129 views1 answer
Javafx tableview remove all rows
Java
6 votes105 views5 answers
Remove duplicates from list java
Java
0 vote131 views1 answer
Spring jpa add field to many to many table
Java Spring
7 votes119 views3 answers
Loop through java object
Java
0 vote133 views2 answers
Programming scares me
Java
0 vote123 views1 answer
Get imei programmatically android
Java
4 votes129 views6 answers
Java do while loop
Java
1 vote114 views1 answer
Java add element to map
Java
0 vote101 views1 answer
Save bitmap file for share on android 10
Java
0 vote108 views1 answer
Not allowed to bind to service Intent
Java