Question: Question 2 ( a ) Apply the same approach we used in class to solve the recurrence T ( n ) = 3 T (

Question 2
(a) Apply the same approach we used in class to solve the recurrence T(n)=3T(n/2)+ O(n). What is the general form of the k-th term in this case? What value of k should be used to find the final answer?
(b) Solve the recurrence T(n)= T(n1)+O(1), which is not covered by the master theorem. Can you find a solution for this case?

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 Programming Questions!