Sollicitatievraag bij UBS

Few algorithms for computing efficiently the Fibonacci sequence

Antwoord op sollicitatievraag

Anoniem

3 apr 2024

Naive (constant space, O(n) in time), or using efficient computation of power of any real number (O(log n) in time).