1 votes 1 votes how do i apply master theorem to this? T(n)=2T(n/2)−n^3n Algorithms algorithms master-theorem recurrence-relation asymptotic-notation + – mdboi asked Oct 28, 2022 mdboi 778 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Kabir5454 commented Oct 28, 2022 reply Follow Share you can’t apply masters theorem on this . 1 votes 1 votes Pranavpurkar commented Oct 29, 2022 reply Follow Share because of the minus right? it is not in the form of $aT(\frac{n}{b}) + \Theta (n^{k}log_{n}^{p})$ 0 votes 0 votes Kabir5454 commented Oct 29, 2022 reply Follow Share yes 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes We cannot apply master theoram here. To apply master theoram the recurrence relation should be in the form: T(n) = aT(n/b) + f(n) nishantsharma answered Jan 11, 2023 nishantsharma comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes We can not apply the Master theorem for the above-given recurrence relation T(n) = 2T(n/2)−n^3n because it should follow T(n)=aT(n/b)+f(n) format where a>=1,b>1,k>=0 and p should be real number. seema__ answered Apr 13, 2023 seema__ comment Share Follow See all 0 reply Please log in or register to add a comment.