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 vote320 views1 answer
How to make 2 nested loops to count to 100
Java
0 vote349 views1 answer
Are strings modifiable
Java
44 votes408 views10 answers
Youtube
Java
0 vote392 views2 answers
Springbootservletinitializer maven dependency
Java Spring
1 vote325 views1 answer
How to implement linked list in java without using collection framework
Java
0 vote307 views1 answer
How to use advanced math in java
Java
3 votes353 views2 answers
Java scanner string nextline after nextint
Java
1 vote295 views1 answer
Discord jda remove @everyone from channel
Java
0 vote351 views1 answer
Java get object from string name
Java
1 vote354 views1 answer
Android dark theme programmatically
Java