Project Nayuki personal blog
Fast Fibonacci Algorithms (2015)
Definition: The Fibonacci sequence is defined as \(F(0) = 0\), \(F(1) = 1\), and \(F(n) = F(n-1) + F(n-2)\) for \(n ≥ 2\). So the sequence (starting with \(F(0)\)) is 0, 1, 1, 2, 3, 5, 8, 13, 21, ….
- Points
- 102
- HN comments
- 77
- Submissions
- 2
- Cited by
- 4 commenters
Math & AlgorithmsSoftware Engineering2016
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Nov 4, 2016 | Fast Fibonacci Algorithms (2015) by old_sound | 102 | 28 |
| Apr 3, 2015 | Fast Fibonacci by brudgers | 69 | 49 |
Cited in comments
Linked from 5 Hacker News comments by 4 different people, from May 2015 to Feb 2019.
Most recent:
- jacobolus · Feb 21, 2019
- nayuki · Feb 21, 2019
- cousin_it · Mar 10, 2018
- Johnny_Brahms · May 17, 2016
- cousin_it · May 18, 2015
