Frage im Vorstellungsgespräch bei HERE Technologies
Write a program that outputs the Fibonacci sequence.
Antwort im Vorstellungsgespräch
Anonym
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.