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

3 votes192 views1 answer
App.java is not on the classpath of project
Java
4 votes183 views2 answers
Java array get index
Java
0 vote181 views1 answer
Java delete element from list
Java
0 vote205 views1 answer
How to change background color of grid in grid layout in android
Java
5 votes244 views2 answers
Spring boot security maven
Java Spring
4 votes168 views1 answer
Find difference in days between two dates java
Java
4 votes190 views2 answers
Fullscreen activity android
Java
1 vote178 views1 answer
Java ints to color int
Java
0 vote186 views8 answers
Xjava
Java
0 vote173 views1 answer
Android setTextColor not working
Java