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

1 vote234 views1 answer
Convert ASCII to String Java
Java
0 vote164 views3 answers
How to turn enum into strings
Java
0 vote201 views1 answer
Uri.builder in android studio
Java
58 votes142 views8 answers
Array with java
Java
1 vote229 views1 answer
Resultset get value
Java
0 vote212 views1 answer
The Google Mobile Ads SDK was initialized incorrectly. AdMob publishers
Java
0 vote206 views4 answers
Convert java to c++
Java
0 vote245 views1 answer
Jaccard index two vectors R
Java
151 votes324 views6 answers
Input java
Java
1 vote200 views1 answer
Spring boot id auto generated
Java