All Languages >> Java >> fibonacci numbers using recursion in java

“fibonacci numbers using recursion in java” Code Answer

fibonacci numbers using Recursion in Java

java by codelearner on Feb 04 2022 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);
        }
    }
}

Source: www.scaler.com

Add a Grepper Answer