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 vote260 views1 answer
Tree algorithm example
Java
1 vote253 views1 answer
Java botton code
Java
1 vote276 views3 answers
Java check if dates are the same day
Java
1 vote297 views1 answer
Comparable
Java
6 votes244 views3 answers
Minecraft mod
Java
-4 votes256 views4 answers
How to use Add Grepper Answer (a)
Java
6 votes221 views2 answers
Abstract vs interface java
Java
0 vote260 views1 answer
How to know when user is done typing android
Java
1 vote251 views3 answers
Convert c to java
Java
2 votes327 views1 answer
Call activity with data android studio
Java