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 vote302 views1 answer
Show input dialog java
Java
0 vote315 views3 answers
Uppercase java
Java
0 vote273 views1 answer
Java get difference days without weekends
Java
0 vote304 views1 answer
Bukkit how to make a cancelable event
Java
0 vote296 views1 answer
Natural log in java
Java
1 vote345 views1 answer
Spring xml file configuration
Java Spring
0 vote274 views1 answer
Write a method multiply() in a class Arithmetic
Java
0 vote303 views1 answer
Android generate random int
Java
5 votes280 views1 answer
Square root of a number in java without sqrt
Java
0 vote329 views1 answer
Java startswith regex
Java