/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 vote149 views1 answer
Retrofit post header
Java
0 vote161 views1 answer
Send image file to server useing Retrofit
Java
15 votes153 views6 answers
Convert array to list java
Java
89 votes235 views5 answers
Split in java
Java
7 votes148 views1 answer
How to reverse order of arraylist
Java
13 votes159 views2 answers
Android cardview dependency
Java
0 vote164 views1 answer
Get char out of string java
Java
11 votes157 views2 answers
Java generics
Java
0 vote148 views1 answer
How to create a new imageview in android java
Java
0 vote155 views1 answer
Get string of radio button in android
Java