Amazon interview question

Analyze a method for Fibonacci numbers.

Interview Answer

Anonymous

28 Mar 2011

Recursive = O(2^n), iterative = O(n)