Comment on A Linear Algebra Trick for Computing Fibonacci Numbers Fast

<- View Parent
cbarrick@lemmy.world ⁨1⁩ ⁨year⁩ ago

The article is comparing to the dynamic programming algorithm, which requires reading and writing to an array or hash table (the article uses a hash table, which is slower).

The naive algorithm is way faster than the DP algorithm.

source
Sort:hotnewtop