Live data from Hacker News

Fibonacci as per Djikstra

avadhutp.github.io

1–3 of 3 posts

Re: Fibonacci as per Djikstra

#2
Stupid way to compute F(n) recursively - exponentially stupid. Far more efficient to run forward - that converts exponential complexity into linear complexity. Or if you insist on using the stupid version, cache the results.

An otherwise interesting article, ruined by that stupidity.