Restructuring

solutions/ProjectEuler/002/solve.js

@@ -0,0 +1,11 @@
+sum = 2;
+fib = new Array( 1, 2, 3 );
+	while(fib[2] < 4000000)
+{
+	fib[2] = fib[0] + fib[1];
+	if(fib[2] % 2 == 0)
+		sum += fib[2];
+	fib[0] = fib[1];
+	fib[1] = fib[2];
+}
+console.log(sum );