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. a)
Determine Big O for the following recurrence relations using the Master Theorem if applicable, otherwise use Repeated Substitution. Show your work. Simplify the answer.
a) T(n) = 1 when n=1 T(n) = 8T(n/4) + n2 when n>1
b) T(n) = 1 when n=1 T(n) = 2T(n - 1) + 1 when n>1

Master Theorem For T(n) = A T(n/B) + O(n") where A 21,B> 1 T(n)= O(n.984), A> Bk O(nk log n), A= B Q(n), A
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
