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

5 votes362 views2 answers
Explain JDK, JRE and JVM?
Java
0 vote351 views1 answer
Why is write replacing my text java
Java
1 vote350 views1 answer
Android how to determine if the edit text focus changes
Java
3 votes373 views3 answers
How to change my file into binary data using java
Java
0 vote346 views1 answer
Convert Octal to Binary in java
Java
0 vote376 views2 answers
@embeddedid
Java
0 vote366 views2 answers
How to call intent in adapter class in android
Java
0 vote356 views1 answer
Java map tostring
Java
12 votes371 views2 answers
Run spring boot application command line
Java
0 vote351 views1 answer
Make the array stop in java
Java