retagged by
578 views
0 votes
0 votes
retagged by

1 Answer

0 votes
0 votes
We can solve it using master theoram. The answer is theta(n^4)

Related questions

5.4k
views
4 answers
2 votes
vishal8492 asked Oct 11, 2016
5,357 views
I've been struggling to come to exact solution for this. Master's theorem is not applicable and likely way to get to answer is Recursion tree. Which is giving me ... ( √n log n ) , would appreciate if someone could shed light how so ?
1.1k
views
1 answers
1 votes
mdboi asked Oct 29, 2022
1,111 views
how do i apply master theorem to this?
846
views
2 answers
1 votes
mdboi asked Oct 28, 2022
846 views
how do i apply master theorem to this? T(n)=2T(n/2)−n^3n