0 votes 0 votes On which of the following recurrence relation Master Theorem cannot be applied? a) T(n)=2T(n/2)+nlogn b) T(n)=T(n/2)+1 c) T(n)=8T(n/2)+logn d) T(n)=7T(n/4)+n^2 Algorithms algorithms master-theorem + – Sandy Sharma asked Aug 1, 2018 Sandy Sharma 804 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Rishav Kumar Singh commented Aug 1, 2018 reply Follow Share Shaik Masthan May i know On what ground we can say that Master Theorem cannot be applied on A. As we can see that a=2>=1, b=2>1, k=1>=0 and p=1=any real number, This satisfies all condition and good to go for Master Theorem. 0 votes 0 votes Shaik Masthan commented Aug 1, 2018 reply Follow Share sorry, i don't know, if you want to read https://cs.stackexchange.com/questions/1957/master-theorem-not-applicable https://en.wikipedia.org/wiki/Master_theorem_(analysis_of_algorithms) 2 votes 2 votes Rishav Kumar Singh commented Aug 1, 2018 reply Follow Share Thanks for the link, it helped 0 votes 0 votes Please log in or register to add a comment.