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

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

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!