Twelve Simple Algorithms to Compute Fibonacci Numbers · HackerPapers discussions

Twelve Simple Algorithms to Compute Fibonacci Numbers — mentioned by ChrisLomont

Tue, 25 Jan 2022 22:23:56 GMT

No, I am not saying that. I am saying we can compute F(n) exactly in O(log n) time. All the digits. That Fibonacci identity I posted allows computing exactly every single integer digit by rounding at the end, because the other term goes to zero as n goes to infinity, and that other term is always less than 1. There are papers showing the complexity I claimed is true. For example, [1]. Algorithm 3.7, on page 15, and I quote: "Hence, with constant time arithmetic, the time complexity is O(lg n). The space complexity is also logarithmic in n." It uses the same ideas as the algorithm I suggested.…

Paper and discussion history. A mention is not an endorsement.

Twelve Simple Algorithms to Compute Fibonacci Numbers — HN submission

Sat, 29 Feb 2020 20:44:07 GMT

Show HN: Twelve Simple Algorithms to Compute Fibonacci Numbers

13 points; 4 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Twelve Simple Algorithms to Compute Fibonacci Numbers — mentioned by noblestone

Sat, 23 Feb 2019 20:00:19 GMT

For students learning introduction to algorithms, I have implementations for 12 simple Bibonacci number computation algorithms at https://github.com/alidasdan/fibonacci-number-algorithms . A related paper is at https://arxiv.org/abs/1803.07199 . Hope they can be useful.

Paper and discussion history. A mention is not an endorsement.