Is there a way to increase the efficiency of the algorithm below:
function sumFibs(num) {
var fibArr = [1, 1];
var lastIndex = fibArr[fibArr.length - 1];
var sum = 0;
while(lastIndex <= num){
sum = fibArr.filter(function(val){
if (val % 2 === 0){
return false;
}else {
return true;
}
}).reduce(function(prev, curr){
return prev + curr;
});
lastIndex = fibArr[fibArr.length - 1] + fibArr[fibArr.length - 2];
fibArr.push(lastIndex);
}
return sum;
}
sumFibs(10);