Skip to content

Comment on On calculating Fibonacci numbers in Cparent

Comments

The number n has O(log(n)) digits, but that has nothing to do with the subject at hand. The nth fibonacci number has O(n) digits.

And nothing in my comment relates to "number of transistor switches or CPU cycles required for a single multiplication".

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.