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 vote104 views1 answer
Empty string databinding android
Java
1 vote125 views1 answer
Shakescleare merchant of venice
Java
0 vote141 views1 answer
Javafx how to get the selected index of the seleceted elment in listview
Java
3 votes115 views2 answers
Java ArrayList copy
Java
-1 vote143 views1 answer
Java byte array to blob
Java
19 votes114 views6 answers
Java array to list
Java
10 votes102 views1 answer
Intent android open activity
Java
68 votes149 views6 answers
Remove duplicates from list
Java
4 votes106 views2 answers
ReentrantLock java
Java
0 vote61 views1 answer
How to clear the consol after input java
Java