Question: Analyze the time complexity of the recursive Fibonacci algorithm in M3. Assignment 1 in terms of how many lines of code will be executed. Look
Analyze the time complexity of the recursive Fibonacci algorithm in M3. Assignment 1 in terms of how many lines of code will be executed. Look very carefully at your recursive code. If you use an n of 5, how many lines of code will be executed?
Create a binary tree that stores your calls. How many calls will each internal node make? How many internal nodes will you have for a recursive version of the solution? Now, how big is that number? What if you call 5 n and think of Fib(n). What is the runtime complexity of your solution?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
