silvermist
BAN USERYou are almost correct. Simple code here for Fibonacci .
fib(n) {
prev = 1
prev_prev = 1
for i = 2 to n do
prev = prev + prev_prev
prev_prev = prev - prev_prev
return prev
}
You will need to save only last two values to calculate the current value and can discard
all other values.
Reference: Introduction to Algorithms, 3rd Edition by Cormen, Leiserson, Rivest, Stein
You are almost correct. Simple code here for Fibonacci .
fib(n) {
prev = 1
prev_prev = 1
for i = 2 to n do
prev = prev + prev_prev
prev_prev = prev - prev_prev
return prev
}
You will need to save only last to values to calculate the current value and can discard
all other values.
Reference: Introduction to Algorithms, 3rd Edition by Cormen, Leiserson, Rivest, Stein
You are almost correct. Simple code here for Fibonacci .
fib(n) {
prev = 1
prev_prev = 1
for i = 2 to n do
prev = prev + prev_prev
prev_prev = prev - prev_prev
return prev
}
You will need to save only last to values to calculate the current value and can discard
all other values.
Reference: Introduction to Algorithms, 3rd Edition by Cormen, Leiserson, Rivest, Stein
Section: Dynamic programming
You are almost correct. Simple code here for Fibonacci here.
fib(n) {
prev = 1
prev_prev = 1
for i = 2 to n do
prev = prev + prev_prev
prev_prev = prev - prev_prev
return prev
}
You will need to save only last to values to calculate the current value and can discard
all other values.
Reference: Introduction to Algorithms, 3rd Edition by Cormen, Leiserson, Rivest, Stein
Section: Dynamic programming
You are almost correct. Simple code here for Fibonacci here.
fib(n) {
prev = 1
prev_prev = 1
for i = 2 to n do
prev = prev + prev_prev
prev_prev = prev - prev_prev
return prev
}
You will need to save only last to values to calculate the current value and can discard
all other values.
Reference: Introduction to Algorithms, 3rd Edition by Cormen, Leiserson, Rivest, Stein
Section: Dynamic programming
You are right... because the value is of n is post-decremented, so n=10 is passed every time.
- silvermist March 29, 2012