Sollicitatievraag bij Bloomberg

Algorithm runtime analysis: What's the complexity of computing the fibonacci numbers?

Antwoorden op sollicitatievragen

Anoniem

20 mrt 2014

O(1) using the closed formula

Anoniem

7 mrt 2016

Depends on implementation. For example naive implementation O(n).