Question: Complexity exercise 1 Complexity myFunction(n) { if (n0) return myFunction (n/2) + f1(n); return myFunction(n/2) + f2(n); 1. What is the time complexity of myFunction,

 Complexity exercise 1 Complexity myFunction(n) { if (n0) return myFunction (n/2)

Complexity exercise

1 Complexity myFunction(n) { if (n0) return myFunction (n/2) + f1(n); return myFunction(n/2) + f2(n); 1. What is the time complexity of myFunction, if f1 and f2 are constant time? If they are linear? 2. How can myFunction be rewriten in order to improve its performance? What is the complexity of this second version of the function, in the same conditions for f1 and f2 (constant, then linear)

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!