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 vote324 views1 answer
How to set landscape in android studio
Java
35 votes286 views2 answers
Priority queue java
Java
0 vote292 views1 answer
Java plugin spigot messsage console
Java
0 vote308 views1 answer
Write arraylist to outputstream java byte file
Java
0 vote289 views1 answer
Bukkit plugin player variable
Java
0 vote305 views1 answer
What are construtcor java
Java
3 votes331 views2 answers
Uninstall java ac
Java
0 vote307 views1 answer
Copy array of objects in java
Java
6 votes310 views3 answers
Math.round java
Java
0 vote318 views1 answer
Java in terminal
Java