[qntm]

I always find it incredibly difficult to concentrate on comparisons of Fibonacci sequence algorithms when I know for a fact that there is a closed-form expression[1] which gives F(n) in constant time.

[1] http://en.wikipedia.org/wiki/Fibonacci_number#Closed-form_ex...

[Peaker]

Raising something to the power of n is not constant time.