0 votes 0 votes How can we apply Masters theorem to these equations : T(n) = 16*T(n/4) + n! and T(n) = 4*T(n/2) + cn Please explain the process. Algorithms master-theorem time-complexity algorithms asymptotic-notation recurrence-relation + – Rahul Ranjan 1 asked Aug 6, 2018 Rahul Ranjan 1 1.7k views answer comment Share Follow See all 18 Comments See all 18 18 Comments reply Show 15 previous comments Lakshman Bhaiya commented Oct 30, 2018 reply Follow Share @Verma Ashish In equations like $T(n)=T(n/2)+ 2^{n}$ we can apply master's theorem with modifications. How?? 0 votes 0 votes Lakshman Bhaiya commented Oct 30, 2018 reply Follow Share @nephron this pdf is really helpful thanks 0 votes 0 votes Verma Ashish commented Oct 30, 2018 reply Follow Share There are many questions on gate overflow, on which after modification therom is applied.. https://gateoverflow.in/247755/can-we-solve-the-recurrence-n-by-masters-theorem-if-possible 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Master theorem can be applied to both of them. Check this : http://www.csd.uwo.ca/~moreno//CS424/Ressources/master.pdf nephron answered Oct 30, 2018 nephron comment Share Follow See all 0 reply Please log in or register to add a comment.
