/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 vote246 views1 answer
What is marshalling and unmarshalling in java
Java
3 votes276 views2 answers
Remove duplicates from sorted array
Java
1 vote263 views1 answer
Java print stacktrace to file
Java
0 vote255 views1 answer
How to remove all characters after a certain character from a string in java
Java
0 vote252 views1 answer
Sorting boolean array with prime index
Java
0 vote254 views2 answers
About action Listioner in java Swing
Java
0 vote251 views1 answer
Java program to print decimal to octal conversion
Java
0 vote327 views1 answer
Get node inside node in of xml using java
Java
0 vote247 views1 answer
Make new file in intellij for java
Java
4 votes318 views2 answers
Java reentrantlock
Java