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 vote114 views1 answer
Java singly linked list example 2 res
Java
0 vote124 views1 answer
UTC in Java
Java
0 vote125 views1 answer
Ecrire methode permettant de gerer l'emprunt d'un livre en java
Java
0 vote133 views1 answer
Spinner android add underline like edittext
Java
0 vote116 views1 answer
Day of week integer to name of day in java
Java
-1 vote111 views1 answer
Save text in edditext java
Java
1 vote129 views1 answer
How to create a popup window (PopupWindow) in Android
Java
1 vote121 views1 answer
Read Text Files in Java with BufferedReader
Java
0 vote202 views1 answer
Treeset java descending order using comparator
Java
0 vote293 views2 answers
Open camera in android
Java