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](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f2e81c3a0cd_16366f2e81b97546.jpg)
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
Get step-by-step solutions from verified subject matter experts
