Sreeja Mukherjee @bongbirdie added a Question 22 Feb 2017 How to solve master's theorem? For this, if we apply master's theorem, I am getting the answer as O(n^3). Please solve this query. 2Comments thumbs up down up0 like abhinandan @abhinandan 22 Feb 2017 09:13 pm here the recursive equaltion will be t(n)=8t(n/2)+ O(n^3) now if you will apply the master's theorm then u will get the anser as (n^3)* logn up5 liked Log in or register to post comments Sreeja Mukherjee @bongbirdie 22 Feb 2017 09:24 pm Got it Thanks :) up0 like Log in or register to post comments

here the recursive equaltion will be t(n)=8t(n/2)+ O(n^3)

now if you will apply the master's theorm then u will get the anser as (n^3)* logn

Got it Thanks :)