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 vote220 views1 answer
Android ask if system is in dark mode
Java
0 vote227 views1 answer
Install java debian 8
Java
1 vote221 views1 answer
Utils code for plugin minecraft
Java
0 vote210 views1 answer
Colors java intell print
Java
1 vote217 views1 answer
Set method in listiterator in java
Java
0 vote241 views1 answer
Split the argument String and add the tokens into a list
Java
0 vote222 views1 answer
Printing cube root of a number in java
Java
3 votes237 views5 answers
How to disable screen rotation android studio
Java
1 vote224 views1 answer
Gradle reflections
Java
0 vote221 views1 answer
Sorting collections with comparator java
Java