Skip to content

Added bottom up DP implementation of Fibonacci #16

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
the-codingninja merged 2 commits into from
Oct 25, 2017
Merged

Added bottom up DP implementation of Fibonacci #16

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
6aaa663
Added bottom up DP implementation of Fibonacci
EternalEnvy Sep 28, 2017
ac34d5d
Add comments
EternalEnvy Oct 25, 2017
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
25 changes: 25 additions & 0 deletions Algorithms/dynamic_programming/fibonacci.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,25 @@
// 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) {
var table = [];
table.push(1);
table.push(1);
for (var i = 2; i < n; ++i) {
table.push(table[i - 1] + table[i - 2]);
}
console.log("Fibonacci #%d = %d", n, table[n - 1]);
}

fib(1);
fib(2);
fib(200);
fib(5);
fib(10);