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

1 vote218 views1 answer
Java print statement
Java
2 votes231 views1 answer
How to print something in java
Java
0 vote239 views1 answer
Icon share android
Java
0 vote240 views1 answer
Nullpointer extension
Java
0 vote213 views1 answer
Get runtime java
Java
0 vote251 views1 answer
Java 8 Functional Interfaces
Java
0 vote237 views1 answer
Re-loop after last item in array java
Java
41 votes233 views3 answers
Java loop hashmap
Java
0 vote233 views1 answer
Bukkit console filter
Java
0 vote224 views1 answer
Random item from arraylist
Java