Question: 3) [16 points total] Consider the following algorithm: int SillyCalc (int n) int i; int Num, answer if (n 0. As part of this analysis

 3) [16 points total] Consider the following algorithm: int SillyCalc (int

3) [16 points total] Consider the following algorithm: int SillyCalc (int n) int i; int Num, answer if (n 0. As part of this analysis do the following: a) [5 points Write a recurrence relation for the worst case performance. b) [10 points] Solve that recurrence relation using back substitution, following the method from class. Verify your solution using induction. c) [1 point] What is the complexity of this algorithm? You just need to state your answer here

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!