/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 vote353 views2 answers
Search a 2D Matrix II
Java
1 vote345 views1 answer
Java collapse string array
Java
0 vote345 views1 answer
Type mismatch cannot convert from string to string in java cucumber
Java
0 vote342 views1 answer
Spinner get item text
Java
0 vote350 views1 answer
Awk print second
Java
3 votes384 views1 answer
How to add cardview in android studio
Java
0 vote391 views1 answer
Enhanced for loop arraylist
Java
0 vote346 views1 answer
A Java-8 stream of batches,
Java
12 votes354 views1 answer
Android manifest cleartext traffic permitted
Java
0 vote378 views1 answer
Java 16 raspberry pi
Java