//Using Recursion
public class FibonacciCalc{
	public static int fibonacciRecursion(int n){
	if(n == 0){
		return 0;
	}
	if(n == 1 || n == 2){
			return 1;
		}
	return fibonacciRecursion(n-2) + fibonacciRecursion(n-1);
	}
    public static void main(String args[]) {
	int maxNumber = 10;
	System.out.print("Fibonacci Series of "+maxNumber+" numbers: ");
	for(int i = 0; i < maxNumber; i++){
			System.out.print(fibonacciRecursion(i) +" ");
		}
	}
}

Popularity 10/10 Helpfulness 7/10 Language java

Source: www.guru99.com

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Apr 17 2022

Cautious Crossbill

0 Answers Avg Quality 2/10

fibonacci series in java using recursion

Comment

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

Popularity 10/10 Helpfulness 5/10 Language java

Source: www.javatpoint.com

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Jan 06 2022

Tender Trout

0 Answers Avg Quality 2/10

fibonacci using recursion in java

Comment

fibonacci using recursion in java

public static int fibonacciRecursion(int n){
	if(n == 0){
		return 0;
	}
	if(n == 1 || n == 2){
			return 1;
		}
	return fibonacciRecursion(n-2) + fibonacciRecursion(n-1);

Popularity 9/10 Helpfulness 5/10 Language javascript

Source: Grepper

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Jan 05 2023

Aadesh Salunkhe

0 Answers Avg Quality 2/10

fibonacci numbers using Recursion in Java

Comment

import java.util.*;
public class fibonacci{
    public static void main(String args[]){
        int n;
        Scanner sc= new Scanner(System.in);
        n=sc.nextInt();
        sc.close();
        System.out.println(fibo(n));
    }
    public static int fibo(int n){
        if(n==1)return 0;
        else if(n==2)return 1;
        else{
            return fibo(n-1)+fibo(n-2);
        }
    }
}

Popularity 1/10 Helpfulness 1/10 Language java

Source: www.scaler.com

Tags: fibonacci java numbers recursion using

Link to this answer
Share Copy Link

Contributed on Feb 04 2022

codelearner

0 Answers Avg Quality 2/10

recursion java fibonacci

Contents

More Related Answers