retagged by
1,998 views

1 Answer

Best answer
1 votes
1 votes

Simply Solve Using Master Theorem

T(n)=O(nlog2 M)

Here time complexity depends on value M although we n2 here.

Suppose M=8

T(n)=O(n3)

selected by

Related questions

1 votes
1 votes
2 answers
2
mdboi asked Oct 28, 2022
742 views
how do i apply master theorem to this? T(n)=2T(n/2)−n^3n
1 votes
1 votes
1 answer
3
ItzDc asked Jun 3, 2022
2,857 views
I can't figure out how to proceed and which case it's falling under after calculating h(n)
1 votes
1 votes
1 answer
4
`JEET asked Dec 21, 2018
1,504 views