package p2;/** * 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, ... Find the sum of all the even-valued terms in the sequence which do not exceed one million. * * @author Administrator * */public class P2 { int totalSum = 0; public static void main(String args[]) { new P2().fibonacci(1, 2); } public int[] fibonacci(int i, int j) { int sum=i+j; if((sum%2)==0) { totalSum += sum; if(sum>=1000000) { System.out.println("Biggest fibonacci below 1 million is i: "+i + " j: "+j+" totalSum: "+totalSum); System.exit(0); } fibonacci(j, sum); } else { fibonacci(j, sum); } return new int[] {j,sum}; }}