ProblemTwo

/**
 * Gabriel Menescal
 *
 * Problem 2:
 * Each new term in the Fibonacci sequence is generated by adding the previous two terms.
 * By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
 * By considering the terms in the Fibonacci sequence whose values do not exceed four
 * million, find the sum of the even-valued terms.
 */

public class ProblemTwo {
    public static void main(String[] args) {
        int num = 0;
        int evenSum = 0;
        while (fibonacci(num) < 4000000) {
            if (fibonacci(num) % 2 == 0) {
                evenSum += fibonacci(num);
            }
            num++;
        }
        System.out.println(evenSum);
    }

    public static int fibonacci(int num) {
        if (num == 0) {
            return num;
        } else if (num == 1) {
            return num;
        } else {
            return fibonacci(num - 1) + fibonacci(num - 2);
        }
    }
}

// OUTPUT: 4613732