Question: Consider the following C function. int fun({ if(n=2) return 1: else return fun(n) } Represent this function by recurrence and find out the time complexity
Consider the following C function. int fun({ if(n=2) return 1: else return fun(n) } Represent this function by recurrence and find out the time complexity
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
