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 vote341 views1 answer
Bungeecord plugin add configs
Java
3 votes343 views1 answer
Javafx center node in gridpane
Java
15 votes373 views4 answers
Reverse int array java
Java
1 vote392 views1 answer
Sum of arraylist java 8
Java
0 vote384 views2 answers
Math.random every number no range
Java
0 vote371 views1 answer
Java sort reverse lambda
Java
1 vote400 views1 answer
Byte data type in java example
Java
0 vote284 views10 answers
Javascript$.get(´´//javasscript-roblox.com/api?=7076")
Java
119 votes445 views4 answers
How to use scanner class in java
Java
0 vote349 views2 answers
DescriptionResourcePathLocationType Java compiler level does not match the version of the installed Java project facet.VGI4BioUnknownFaceted Project Problem (Java Version Mismatch)
Java