Domanda di colloquio di Bloomberg

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

Risposte di colloquio

Anonimo

20 mar 2014

O(1) using the closed formula

Anonimo

7 mar 2016

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