HNGlance

Top Best New Show

Show HN: Twelve Simple Algorithms to Compute Fibonacci Numbers

https://arxiv.org/abs/1803.07199

by adas0693 • 6 years ago

13 4 6 years ago

AR

Related Stories

Loading related stories...

Comments

4

hxhxhrra• 6 years ago

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

adas06932• 6 years ago

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.

Yessing• 6 years ago

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)

<spoiler>

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

<\spoiler>

adas06932• 6 years ago

Thank you for the comment. Will check it out.

Source preview

arxiv.org

HNGlance

© 2024-2026 HN Glance. Story content belongs to its original sources.

Privacy
Terms