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 vote206 views1 answer
Setting up javafx in eclipse vm argument
Java
1 vote195 views1 answer
Recompile with -Xlint:deprecation
Java
106 votes263 views6 answers
Integer to string java
Java
1 vote275 views2 answers
IllegalStateException: Cannot load driver class: oracle.jdbc.driver.OracleDriver
Java
0 vote236 views1 answer
How do I make my Android app scrollable?
Java
1 vote207 views1 answer
Null checker on addAll java
Java
7 votes207 views2 answers
How to add to an arraylist java
Java
0 vote216 views2 answers
How to add background color in jframe
Java
0 vote288 views1 answer
Como detener un void java
Java
12 votes197 views1 answer
What it means when create final variable in java
Java