/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 vote151 views1 answer
Clear a list in java
Java
3 votes139 views3 answers
Java tutorial
Java
0 vote133 views1 answer
Call c function from java
Java
1 vote146 views1 answer
Convert date to calendar java
Java
5 votes142 views2 answers
Print map in java log
Java
0 vote148 views1 answer
Java program to swap two numbers using bitwise xor operator
Java
1 vote154 views1 answer
Convert datetime to custom format in java 8
Java
2 votes141 views1 answer
Primefaces custom validator
Java
1 vote125 views1 answer
How to download java on mint
Java
1 vote199 views1 answer
How to draw a rectangle in libgdx
Java