Breaking News: Grepper is joining You.com. Read the official announcement!

fibonacci for biginteger

Techie Ash answered on January 6, 2022 Popularity 2/10 Helpfulness 3/10

answer fibonacci for biginteger

fibonacci for biginteger

Comment

import java.math.BigInteger;
import java.util.Scanner;

public class FibonacciRecursion {

    public static BigInteger fibonacci(int n) {
        if (n == 1 || n == 2) {
            return BigInteger.ONE;

        }else if(n==0){
            return BigInteger.ZERO;
        }
        else {
            return (fibonacci(n - 1).add(fibonacci(n - 2)));
        }

    }


    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        BigInteger ans = fibonacci(n);
        System.out.println(ans);
    }

}

Popularity 2/10 Helpfulness 3/10 Language java

Source: Grepper

Tags: biginteger fibonacci java

Link to this answer
Share Copy Link

Contributed on Jan 06 2022

Techie Ash

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

fibonacci for biginteger

Contents

More Related Answers

fibonacci for biginteger

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.