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 vote147 views1 answer
8233*4
Java
2 votes170 views1 answer
Taking date as input in java
Java
21 votes185 views5 answers
Android java string to double
Java
2 votes166 views2 answers
Left fold java
Java
13 votes151 views2 answers
Android cardview dependency
Java
10 votes128 views1 answer
How to get 2 decimal places in java
Java
0 vote155 views1 answer
Discord jda await msg
Java
1 vote148 views5 answers
Treemap java
Java
0 vote158 views1 answer
Java string util if empty default
Java
4 votes145 views1 answer
Java calculate fps
Java