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 vote315 views1 answer
Framboise bleue ou mure
Java
0 vote293 views1 answer
Change fab image programatically
Java
0 vote263 views1 answer
Double.min in java
Java
1 vote358 views1 answer
Javafx location is required
Java
0 vote308 views1 answer
Key listener java
Java
6 votes341 views2 answers
Android create snackbar
Java
2 votes322 views2 answers
Split each character in a string (java)
Java
0 vote316 views1 answer
Thread example in android
Java
136 votes479 views6 answers
How to generate a random number in java
Java
0 vote394 views1 answer
LocalStorage android webview
Java