Fibonacci Program Using Recursion in Java

9/3/2021
All Articles

#Fibonacci Program Using Recursion in Java #java #Recursion #Program #java program # factorial program java # program in java

Fibonacci Program Using Recursion in Java

Fibonacci Program Using Recursion in java - java Fibonacci program

 

The Fibonacci series is a sequence of numbers in which each number is the sum of the two preceding numbers ones. 
The sequence starts with 0 and 1, 
and then each subsequent number is the sum of the two previous numbers. The Fibonacci series is look like  this:
0, 1, 2, 3, 4, 5, 6,   7,  8,   9,  10, 11,  12 
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144 ...

Let's See the Fibonacci Program Using Recursion in Java.

Example 1:

class FibonacciRecursion{  
 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   
 }

 

Conclusion :

Although straightforward, the recursive method can lose efficiency for bigger values of n because it involves repeated calculations. 
 Memorization or dynamic programming techniques can be used to store interim findings and reduce the need for repeated computations.
 

This Solution is provided by Shubham mishra .This article is contributed by Developer Indian team. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.Also folllow our instagram , linkedIn , Facebook , twiter account for more

 

Article