/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 vote132 views1 answer
Java.lang.stackoverflowerror null onetomany
Java
0 vote132 views1 answer
How to print byte array in java
Java
0 vote96 views1 answer
Processing java screen wrap
Java
0 vote135 views1 answer
First and last element of array java
Java
26 votes132 views6 answers
Java list to array
Java
1 vote129 views1 answer
How to start a java program
Java
1 vote120 views1 answer
Jdbc driver servertimezone configuration property
Java
0 vote148 views1 answer
@bean annotation in spring boot
Java Spring
0 vote130 views1 answer
How to get start char in string in java
Java
0 vote132 views1 answer
Android play sound file from assets
Java