MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
What_is_the_space_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» E. | |