Show HN: Twelve Simple Algorithms to Compute Fibonacci Numbers (opens in new tab)

(arxiv.org)

13 pointsadas06936y ago4 comments

4 comments

another interesting fact:

if you have to compute the fib of very large numbers mod n. you can use the fact that the fibonnaci numbers would repeat.( see: https://en.wikipedia.org/wiki/Pisano_period)

this allows you to solve problems like this: https://www.spoj.com/problems/FIBHARD/

<\spoiler>

Thank you for the comment. Will check it out.

Algorithm fib1 („Dynamic Programming without Memoization“) is just ordinary recursion and not dynamic programming.

Thank you for the comment. Pls refer to many references on the Web on the use of Fibonacci sequence as a dynamic programming example or illustration.

j / k navigate · click thread line to collapse