For this, if we apply master's theorem, I am getting the answer as O(n^3). Please solve this query.
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 :)