Bloomberg Interview Question: Algorithm runtime analysis: What's the complexity of computing the fibonacci numbers? | Glassdoor

Skip to content Skip to footer

Notifications

Loading...

employer cover photo

Bloomberg

Bloomberg 2014 Financial Software Developer - Entry Level interview

Bloomberg interview question

2014 Financial Software Developer - Entry Level Interview

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

Interview Answers

Anonymous

20 Mar 2014

O(1) using the closed formula

Anonymous

7 Mar 2016

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

Related searches: Bloomberg reviews | Bloomberg jobs | Bloomberg salaries | Bloomberg benefits | Bloomberg conversations

Bloomberg interviews