public class Recursive {

    // fibonacci recursive
    public static int fibonacciRecursion( int nthNumber) {
        if (nthNumber == 0) { //base case
            return 0;
        } else if (nthNumber == 1) { //base case
            return 1;
        } //recursive call
        return fibonacciRecursion(nthNumber - 1) + fibonacciRecursion(nthNumber - 2);
    }
    
    // fibonacci iterative
    public static int fibonacci(int n) {
        if (n <= 1) {
            return n;
        int number=1;
        int prevNumber=1;
        for (int i = 2; i < n; i++) {
            int temp = number;
            number += prevNumber;
            prevNumber = temp;
        }
        return number;
    }
}

System.out.println("Fibonacci Recursion: " + Recursive.fibonacciRecursion(10));
System.out.println("Fibonacci Iteration: " + Recursive.fibonacci(10));