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 vote172 views1 answer
X/=y is the same as x=x/y
Java
0 vote125 views1 answer
Android tab theme
Java
0 vote140 views1 answer
How to translate java swing
Java
0 vote127 views1 answer
The longest substring
Java
0 vote128 views1 answer
Java StringBuilder filter same lines
Java
2 votes172 views1 answer
Primefaces custom validate
Java
0 vote160 views1 answer
Spring mvc aop transaction management
Java Spring
0 vote121 views1 answer
Write input stream to file java
Java
0 vote127 views1 answer
Shared preferences make null in android
Java
1 vote123 views1 answer
How to extract decimal vqalue from float in android studio
Java