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 vote374 views1 answer
How to return arraylist as array in java
Java
1 vote340 views1 answer
File java class
Java
0 vote348 views2 answers
Death calculator by date of birth make in java
Java
25 votes340 views3 answers
Java get last char of string
Java
1 vote329 views2 answers
Set icon to fab programmatically in android studio
Java
12 votes356 views3 answers
How to use arrays java
Java
2 votes322 views2 answers
How to change orientation of linearlayout in recyclerview android
Java
0 vote320 views1 answer
How can i convert an int to string java
Java
0 vote354 views3 answers
Test function that call a function javascrip
Java
0 vote343 views1 answer
Counting sort java
Java