Faster Fibonacci Algorithm
You would like to calculate a number N in the Fibonacci sequence but want to do it quickly.
The following solution (which can still be improved on) was originally talked about on Robin Houston's blog.
Here are a few links talking about the algorithm and ways to improve it: * http://bosker.wordpress.com/2011/04/29/the-worst-algorithm-in-the-world/ * http://www.math.rutgers.edu/~erowland/fibonacci * http://jsfromhell.com/classes/bignumber * http://www.math.rutgers.edu/~erowland/fibonacci * http://bigintegers.blogspot.com/2010/11/square-division-power-square-root * http://bugs.python.org/issue3451
This code is in gist form here: https://gist.github.com/1032685