Question: Determine Big O for the following recurrence relations using the Master Theorem if applicable, otherwise use Repeated Substitution. Show your work. Simplify the answer. 1a)

Determine Big O for the following recurrence relations using the Master Theorem if applicable, otherwise use Repeated Substitution. Show your work. Simplify the answer.

1a) T(n) = 1 when n=1,

T(n) = 8T(n/4) + n2 when n>1

1b) T(n) = 1 when n=1,

T(n) = 2T(n-1) + 1 when n>1

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!