1 votes 1 votes how do i apply master theorem to this? 𝑇(𝑛)=16𝑇(𝑛/4)+5𝑛^3 Algorithms algorithms master-theorem recurrence-relation asymptotic-notation time-complexity + – mdboi asked Oct 28, 2022 mdboi 749 views answer comment Share Follow See 1 comment See all 1 1 comment reply Kabir5454 commented Oct 28, 2022 i edited by Kabir5454 Oct 28, 2022 reply Follow Share Compare with standard masters theorem, $T(n)=aT(n/b)+\Theta( f(n))$ So given problem is, $T(n)=16T(n/4)+ \Theta(n^{3})$ So, a=16, b=4. So, $n^{\log_{b}a}=n^{\log_{4}16}=n^{2}$ So , It is the case 3 of the masters theorem where , $f(n)=\Omega (n^{\log_{b}a +\epsilon })$ and it holds regularity condition so , $T(n)=\Theta(f(n))=\Theta(n^{3})$. 5 votes 5 votes Please log in or register to add a comment.
1 votes 1 votes You can apply the extended master theorem: T(n) = aT(n/b) + $\Theta$(n$^{k}$log$^{p}$n) as per the question : a=16,b=4,k=3 and p=0 since a < b$^{k}$ (i.e 16 < 4$^{3}$) p >= 0, therefore T(n) = $\Theta$(n$^{k}$log$^{p}$n) => $\Theta$(n$^{3}$) sreechand answered Nov 1, 2022 sreechand comment Share Follow See all 0 reply Please log in or register to add a comment.