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 vote232 views2 answers
Games
Java
49 votes164 views3 answers
Ex:javascript loop array
Java
6 votes169 views2 answers
Java while schleife
Java
2 votes170 views1 answer
Android list[i]
Java
481 votes499 views10 answers
December global holidays
Java
4 votes160 views3 answers
While loops java
Java
1 vote120 views1 answer
System.out.println giving error syntax error on token ".", @ expected after this token
Java
0 vote156 views1 answer
Are inner classes inherited
Java
0 vote166 views1 answer
How to extract value from payload in java
Java
20 votes184 views2 answers
String.replace in java
Java