Pergunta de entrevista da empresa HERE Technologies
Write a program that outputs the Fibonacci sequence.
Resposta da entrevista
Sigiloso
30 de mai. de 2010
There's a non-efficient O(n^2) way that uses recursion. There's an efficient O(n) way that uses an array.