f(n) = f(n-2) + f(n-1)

Comparing execution time of three fibonacci sequence algorithms implemented in Java

Recursive, n < 40

f( ) Run »

{{ recursive.time }} sec

{{ recursive.result }}

Iterative, n < 1000000

f( ) Run »

{{ iterative.time }} sec

{{ iterative.result }}

Matrix, n < 1000000

f( ) Run »

{{ matrix.time }} sec

{{ matrix.result }}