/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 vote219 views1 answer
Java optional to collection
Java
51 votes212 views6 answers
Java array print
Java
1 vote218 views2 answers
Java text file to arraylist
Java
0 vote215 views1 answer
Java program to find largest of three numbers using nested if
Java
44 votes216 views2 answers
Find last element in array in java
Java
1 vote193 views1 answer
Como utilizar random en java
Java
0 vote208 views2 answers
Convert int color to hex android
Java
0 vote204 views4 answers
Findbyname in jpa
Java
0 vote181 views1 answer
Java filter list based on unique value
Java
4 votes225 views3 answers
Array find max in java
Java