Question: int recursive5(int n) { if (s > 1) { return 2 * recursive5(s-1); } else return s; } 1. Write a recurrence relation(recursive and base)
int recursive5(int n) { if (s > 1) { return 2 * recursive5(s-1); } else return s; }
1. Write a recurrence relation(recursive and base) which describes the running time of this function.
2. Use the repeated substitution method to solve recurrence relation and get running time
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
