0 0 votes T(n)=0.5T(n/2)+n^3 How to solve this using recurrence method? Algorithms recurrence-relation + – Mariela Prasetyo 3.6k views answer comment Share Follow Print See all 7 Comments 7 7 Comments reply arvin commented Oct 5, 2018 reply Follow flag ==>n3-->.5(n/2)3--> .5 *.5*(n/22)3----................. adding all the nodes we will get n3 neglecting the(1+1/16+1/256....................) 0 0 replyShare Utkarsh Joshi commented Oct 5, 2018 reply Follow flag check this 0 0 replyShare Raghav Khajuria commented Oct 5, 2018 reply Follow flag If u go by master's theorem also u will get n^3 because log0.5<3 1 1 replyShare Utkarsh Joshi commented Oct 5, 2018 reply Follow flag master's theorem is not applicable here. a<1 0 0 replyShare Mariela Prasetyo commented Oct 6, 2018 reply Follow flag okay, thank you very much! 0 0 replyShare Sanjay Mahaveer commented Oct 6, 2018 reply Follow flag @Utkarsh Joshi , Did u do with back substitution? 0 0 replyShare Utkarsh Joshi commented Oct 6, 2018 reply Follow flag Tree method. I have posted soln see that@sanjay 0 0 replyShare Please log in or register to add a comment.
0 0 votes master theorem cannot apply beacuse a=0.5 we can apply master theorem only in case of a>=1 Raghava45 answered Oct 6, 2018 Raghava45 comment Share Follow 0 reply Please log in or register to add a comment.
