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 votes200 views1 answer
Java reverse linked list
Java
3 votes207 views5 answers
Declare variable java
Java
3 votes205 views1 answer
How to check object type in java
Java
0 vote203 views1 answer
Marshalling in java
Java
18 votes180 views6 answers
Java for
Java
0 vote186 views1 answer
Android studio set error
Java
1 vote176 views1 answer
Latest dependency for snackbar android
Java
0 vote169 views1 answer
Splitting text with several condition in java
Java
0 vote187 views1 answer
Instance of keyword
Java
0 vote202 views3 answers
Data provider using junit
Java