迭代写法
console.time('迭代');
function sum0(arr) {
var total = 0;
for (var num in arr) {
total += arr[num];
}
return total;
}
var arr = [3, 5, 2, 9, 43, 546, 647, 7689, 2653, 142, 5646, 788];
console.log('迭代结果:', sum0(arr));
console.timeEnd('迭代');
结果:
迭代结果: 18173
迭代: 1.621ms
递归写法:
console.time('递归');
function sum(arr, n) {
return (n < 1) ? 0 : sum(arr, n - 1) + arr[n - 1];
}
var arr = [3, 5, 2, 9, 43, 546, 647, 7689, 2653, 142, 5646, 788];
console.log('递归结果:', sum(arr, arr.length));
console.timeEnd('递归');
结果:
递归结果: 18173
递归: 1.793ms
二分递归写法:
console.time('二分递归');
console.time('二分递归');
function sum2(arr, lo, hi) {
if (lo == hi) return arr[lo];
var mi = parseInt((lo + hi) / 2);
return sum2(arr, lo, mi) + sum2(arr, mi+1, hi);
}
var arr = [3, 5, 2, 9, 43, 546, 647, 7689, 2653, 142, 5646, 788];
console.log('二分递归结果:', sum2(arr, 0,arr.length-1));
console.timeEnd('二分递归');
结果:
二分递归结果: 18173
二分递归: 1.579ms