M
Q. What is the time complexity of the recursive implementation used to find the nth fibonacci term?
Explanation by: Mr. Dubey
the recurrence relation is given by fibo(n) = fibo(n – 1) + fibo(n – 2). so, the time complexity is given by:
You must be Logged in to update hint/solution
Loading Comments....
Related MCQs
Q. In associative mapping, in a 16 bit system the tag field has bits.
Q. Which of the following storage devices can store maximum amount of data?
Q. What is command to find out todays date ?
Q. In McCall’s software quality factors, Product operation phase ----not contains.
Q. What will be the slope of the line given by 10x + 5y + 8=0?
Q. Which of the following can be used for reducing recovery time?
Question analytics
Discusssion
Login to discuss.