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

4 votes109 views1 answer
Java log base 2
Java
0 vote99 views1 answer
Bad notification for startForeground: java.lang.RuntimeException: invalid
Java
0 vote148 views1 answer
Sha 1 key throguh java is not working
Java
0 vote108 views1 answer
Spring Boot - Hashicorp Vault Integration
Java
4 votes104 views4 answers
Math class in java
Java
0 vote100 views1 answer
Sealed class java codegrepper
Java
0 vote129 views1 answer
How to add element to end of array java
Java
0 vote112 views1 answer
Setbackground color hexadecimal android
Java
0 vote114 views1 answer
Java abstract vs interface
Java
0 vote107 views1 answer
Java coding standards for constants
Java