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

0 vote150 views1 answer
At com.android.okhttp.internal.huc.HttpURLConnectionImpl.getInputStream(HttpURLConnectionImpl.java:251)
Java
0 vote137 views1 answer
Assertthat code throws exception
Java
0 vote98 views1 answer
Tostring javadoc
Java
-1 vote213 views1 answer
@notblank annotation spring
Java Spring
-1 vote138 views2 answers
Static class java
Java
7 votes105 views2 answers
Arraylist to string
Java
0 vote147 views1 answer
Split string 2 characters java
Java
0 vote132 views1 answer
How to read a table from text file in java
Java
0 vote133 views1 answer
Converting String Array to an Integer Array
Java
0 vote103 views1 answer
How to remove all characters after a certain character from a string in java
Java