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

2 votes230 views1 answer
Check array is sorted java
Java
1 vote225 views2 answers
React native android gif
Java
0 vote226 views1 answer
Mobile number validation to edittext in android
Java
12 votes242 views3 answers
Cardview implementation
Java
1 vote229 views1 answer
Integer.tostring java
Java
0 vote253 views1 answer
Larger number in java than long
Java
2 votes206 views1 answer
Printing a treeset java
Java
1 vote228 views1 answer
What is the use of println
Java
-2 votes247 views2 answers
Conver str to in java
Java
0 vote262 views2 answers
Spring tag library in jsp header
Java Spring