/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 vote265 views1 answer
111111000
Java
0 vote251 views3 answers
Zweidimensionales array ausgeben java
Java
5 votes227 views3 answers
Console log java
Java
0 vote231 views1 answer
Read File and Resource in JUnit Test into Stream
Java
0 vote240 views1 answer
Java coding standards for classes
Java
0 vote275 views1 answer
ArrayList add at specific index
Java
0 vote243 views1 answer
Java substring based on delimiter
Java
0 vote230 views1 answer
Before first method in jdbc
Java
0 vote257 views1 answer
Get class from generic type java
Java
-2 votes230 views2 answers
How to find a string in a sentence in java
Java