HERE Technologies Interview Question
Write a program that outputs the Fibonacci sequence.
Interview Answer
Anonymous
May 30, 2010
There's a non-efficient O(n^2) way that uses recursion. There's an efficient O(n) way that uses an array.
Write a program that outputs the Fibonacci sequence.
Anonymous
There's a non-efficient O(n^2) way that uses recursion. There's an efficient O(n) way that uses an array.
Check out your Company Bowl for anonymous work chats.