Q:

The fastest Java algorithm for calculating nth term of Fibonacci sequence?

Is it known what is the fastest Java algorithm for calculating nth term of Fibonacci sequence ? 
I have found these algorithms . I guess that Iterative algorithms should be faster than Recursive and Analytic algorithms .  

A:

Precalculate all Fibonacci numbers up to a sufficiently large number of n, and generate a source code snippet defining an array with the numbers in a type which can hold these numbers.
Then you can just retrieve the value in index n in your array.  This is O(1).  Doesn't come much faster than that.

