algorithm - What is time-complexity of T(N)=4T(N/2)+(N^2)/logN -


this question given in mit video on analysis of algorithms, following question can not done using master method , can solved using recurrence tree.

can please tell me solution?

why claim can not done masters theorem?. theorem has constraints a , b constants , a >= 1 , b > 1. hold f(n) , therefore can apply here.

if apply see a=4, b=2 , therefore c = 2. n^c grows faster f(n) , therefore complexity o(n^2).


Comments

Popular posts from this blog

google chrome - Developer tools - How to inspect the elements which are added momentarily (by JQuery)? -

angularjs - Showing an empty as first option in select tag -

php - Cloud9 cloud IDE and CakePHP -