algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-07 19:17:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add comments

Browse Source
This commit is contained in:
Lee Southerst
2017-10-25 10:30:43 -04:00
parent 6aaa663688
commit ac34d5d147
1 changed files with 12 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
Algorithms/dynamic_programming/fibonacci.js
View File

@ -1,3 +1,12 @@
// Calculates fib(n) such that fib(n) = fib(n - 1) + fib(n - 2)
// fib(0) = fib(1) = 1
// Uses a bottom up dynamic programming approach
// Solve each subproblem once, using results of previous subproblems,
// which are n-1 and n-2 for Fibonacci numbers
// Although this algorithm is linear in space and time as a function
// of the input value n, it is exponential in the size of n as
// a function of the number of input bits
function fib(n) { function fib(n) {
var table = []; var table = [];
@ -6,9 +15,11 @@ function fib(n) {
for (var i = 2; i < n; ++i) { for (var i = 2; i < n; ++i) {
table.push(table[i - 1] + table[i - 2]); table.push(table[i - 1] + table[i - 2]);
} }
console.log("The %dth fibonacci number is %d", n, table[n - 1]); console.log("Fibonacci #%d = %d", n, table[n - 1]);
} }
fib(1);
fib(2);
fib(200); fib(200);
fib(5); fib(5);
fib(10); fib(10);