Fibonacci for biginteger

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);
    }

}

Similar codes

0 vote196 views1 answer
Webmvctest vs springboottest
Java
0 vote190 views2 answers
How to select multiple non-consecutive words on mac
Java
1 vote179 views1 answer
Entryset in java loop
Java
6 votes181 views3 answers
Java get current time in seconds
Java
0 vote209 views10 answers
Convert java code to c++ online
Java
0 vote206 views1 answer
Sealed class java codegrepper
Java
0 vote231 views1 answer
Echo java
Java
0 vote210 views1 answer
FranchiseRulesTemp
Java
4 votes187 views3 answers
Java uuid from string
Java
1 vote202 views2 answers
Use findviewbyid in fragment
Java