A Linear Algebra Trick for Computing Fibonacci Numbers Fast
A Linear Algebra Trick for Computing Fibonacci Numbers Fast
codeconfessions.substack.com A Linear Algebra Trick for Computing Fibonacci Numbers Fast
Cracking the Code: Fast Fibonacci Computations With a Linear Algebra Twist
8
comments
Sweet, Sweet, Linear Algebra
7 1 ReplyPermanently Deleted
2 1 ReplyAccording to the article the linear algebra algorithm has a running time of O(log n)
6 0 ReplyYeah, I see now. It's still not going to out perform the naive algorithm until n is huge.
2 0 Reply
I’ll just stick with phi, thank you
2 1 ReplyHow could we live without this?
1 0 Reply
You've viewed 8 comments.
Scroll to top