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

4 votes135 views2 answers
Java Binary Search
Java
0 vote191 views1 answer
Entity cannot be resolved to a type in spring boot eclipse
Java
10 votes125 views5 answers
Java join list
Java
12 votes116 views5 answers
Initialize hashmap with values
Java
0 vote202 views1 answer
Java read first line of file
Java
0 vote124 views1 answer
Using UUID spring boot Neo4J
Java
0 vote121 views1 answer
Android studio clear views of layout
Java
0 vote165 views1 answer
Identifier in java
Java
1 vote128 views1 answer
James Gosling
Java
1 vote126 views1 answer
Min value map
Java