/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

16 votes324 views3 answers
Java character in string
Java
-5 votes362 views1 answer
Android studio get time
Java
1 vote317 views1 answer
Discord jda remove @everyone from channel
Java
0 vote394 views1 answer
How to get internet speed in android programmatically
Java
0 vote332 views1 answer
How to get cpu model number in android programmatically
Java
0 vote337 views2 answers
Android studio clear child views
Java
4 votes332 views2 answers
Java random string
Java
1 vote309 views2 answers
Java list average
Java
1 vote336 views1 answer
MCQ java
Java
1 vote349 views2 answers
Overloading + operator in java
Java