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 vote382 views1 answer
How to check if a person pressed a buuton in jframe
Java
4 votes344 views5 answers
What are variables in java
Java
4 votes387 views4 answers
Main method java
Java
-2 votes347 views1 answer
Java anagrams
Java
0 vote332 views1 answer
Convert int to double with 2 decimal places java
Java
0 vote344 views1 answer
Timestamp with zone java
Java
0 vote336 views2 answers
Quick way to get charAt
Java
1 vote336 views1 answer
Java botton code
Java
0 vote324 views1 answer
Jax-RS PUT annotation
Java
0 vote405 views1 answer
Database springboot
Java Spring