Microsoft interview question
Implement the fibonacci sequence
Interview Answers
Anonymous
7 Nov 2011
First gave the recursive solution everyone knows ie fib(n) = fib(n-1)+fib(n-2). Then I gave the iterative solution when he asked me if the recursive was efficient. You can look that up.