Question d’entretien chez HERE Technologies
Write a program that outputs the Fibonacci sequence.
Réponse à la question d'entretien
Utilisateur anonyme
30 mai 2010
There's a non-efficient O(n^2) way that uses recursion. There's an efficient O(n) way that uses an array.