0 votes 0 votes T(n)=0.5T(n/2)+n^3 How to solve this using recurrence method? Algorithms recurrence-relation + – Mariela Prasetyo asked Oct 5, 2018 retagged Jun 23, 2022 by makhdoom ghaya Mariela Prasetyo 2.7k views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments Mariela Prasetyo commented Oct 6, 2018 reply Follow Share okay, thank you very much! 0 votes 0 votes Sanjay Mahaveer commented Oct 6, 2018 reply Follow Share @Utkarsh Joshi , Did u do with back substitution? 0 votes 0 votes Utkarsh Joshi commented Oct 6, 2018 reply Follow Share Tree method. I have posted soln see that@sanjay 0 votes 0 votes Please log in or register to add a comment.
0 votes 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 See all 0 reply Please log in or register to add a comment.