MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
What is the time complexity of the above recursive implementation to find the nth fibonacci number?$ |
| A. | O(1) |
| B. | O(2*n) |
| C. | O(n<sup>2</sup>) |
| D. | O(2<sup>n</sup>) |
| Answer» D. O(2<sup>n</sup>) | |