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

22 votes143 views1 answer
How to exit a java program
Java
1 vote140 views1 answer
Java boolean 2d array
Java
0 vote175 views1 answer
Filter and map multiple fields from java stream
Java
0 vote172 views1 answer
Run webgoat using docker
Java
0 vote160 views1 answer
Rotate Vector by an angle
Java
1 vote130 views1 answer
Android up navigation
Java
3 votes142 views1 answer
Space in java
Java
1 vote140 views1 answer
Utils code for plugin minecraft
Java
0 vote128 views2 answers
Bootstrap 4 modal get event related target
Java
0 vote142 views1 answer
Eclipse versioning .classpath
Java