retagged by
2,749 views
0 votes
0 votes
T(n)=0.5T(n/2)+n^3

How to solve this using recurrence method?
retagged by

1 Answer

0 votes
0 votes
master theorem cannot apply beacuse a=0.5

we can apply master theorem only in case of a>=1

Related questions

0 votes
0 votes
0 answers
1
Mariela Prasetyo asked Oct 10, 2018
308 views
I need to find the tight bound of the Fibonacci sequence in dynamic programming (using theta). I only know the bound using big O is O(n). Any idea how to do it?
0 votes
0 votes
1 answer
2
[ Jiren ] asked Mar 5, 2023
321 views
0 votes
0 votes
1 answer
3
[ Jiren ] asked Mar 5, 2023
223 views
0 votes
0 votes
2 answers
4
[ Jiren ] asked Mar 5, 2023
225 views