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

1 vote340 views1 answer
Menghitung luas segitiga
Java
0 vote352 views1 answer
Arrondi java
Java
1 vote303 views1 answer
Pivot in array
Java
3 votes333 views2 answers
What is void in java
Java
0 vote325 views1 answer
JAVA HashMap get keys by values
Java
0 vote319 views1 answer
How to get orientation lock to portrait android stackoverflow
Java
0 vote327 views2 answers
&& java
Java
4 votes337 views2 answers
ReentrantLock java
Java
0 vote314 views2 answers
Contain Java
Java
0 vote335 views8 answers
Xjava
Java