What is the time complexity of the following recursive implementation – McqOptions

MCQOPTIONS

1.	What is the time complexity of the following recursive implementation to find the nth fibonacci number?
A.	O(1)
B.	O(2*n)
C.	O(n2)
D.	O(2n)View Answer
Answer» E.

Discussion

No Comment Found

Related MCQs

How many times will the function fibo() be called when the following code is executed?
What is the space complexity of the following recursive implementation to find the nth fibonacci number?
What is the time complexity of the following recursive implementation to find the nth fibonacci number?
Consider the following recursive implementation to find the nth fibonnaci number: Which of the following is the base case?
Consider the following recursive implementation to find the nth fibonacci number: Which of the following lines should be inserted to complete the above code?
Which of the following recurrence relations can be used to find the nth fibonacci number?
What is the time complexity of the above recursive implementation to find the nth fibonacci number?$
What_is_the_space_complexity_of_the_above_recursive_implementation_to_find_the_nth_fibonacci_number?
Which of the following recurrence relations can be used to find the nth fibonacci number?
Which of the following methods can be used to find the nth fibonnaci number?