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 vote172 views1 answer
Java easy list
Java
10 votes161 views10 answers
Hello
Java
1 vote159 views4 answers
Get last day of month java
Java
1 vote174 views2 answers
Android java log
Java
0 vote172 views1 answer
Ark survival evolved mod apk
Java
0 vote162 views1 answer
Java pattern check
Java
0 vote150 views7 answers
Iptc classification java code example
Java
0 vote186 views1 answer
Java intent extras
Java
0 vote163 views1 answer
Java substring based on delimiter
Java
2 votes157 views10 answers
Javascript
Java