2) + nlogn

by AjinkGupta in Analysis of Algorithms asked Jan 24 11 views

Solve the following using master method:
i. T(n) = 8T(n/2) + n^2
ii. T(n) = 4T(n/2) + nlogn

0 like 0 dislike

Your comment on this question:

Your name to display (optional):

Email me at this address if a comment is added after mine:Email me if a comment is added after mine

Privacy: Your email address will only be used for sending these notifications.

Thanks for contributing an answer!

Avoid writing here -

Your name to display (optional):

Email me at this address if my answer is selected or commented on:Email me if my answer is selected or commented on

Privacy: Your email address will only be used for sending these notifications.