Register

Homework

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

How to solve this using recurrence method?

1 Answer

0 0 votes
master theorem cannot apply beacuse a=0.5

we can apply master theorem only in case of a>=1
Voting & Accepting an answer helps improve the community
← Previous · Self doubtNext → · Testbook Test Series...
← Previous in category · Made Easy test serie...Next in category → · Self-doubt - Case of...
Position:
Show:

Related questions

2 2 votes
1 1 answer
627
627 views
Amad_Os asked Oct 24, 2025
627 views
Homework
What is the complexity of the following using Big O:
0 0 votes
0 0 answers
549
549 views
Mariela Prasetyo asked Oct 10, 2018
549 views
homework
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?
2 2 votes
1 1 answer
161
161 views
Abhishikta Saha asked Feb 24
161 views
go classes homework
Consider two processes Po and P1.Code for Process Pox_{2} = 0while (x_{1}! = 1) ;CSx_{2} = 1Code for Process P1x_{1} = 0 ;while (x2 != 1);x_{1} = 1x1 and x2 are initializ...
0 0 votes
1 answers 1 answer
1.0k
1.0k views
tarunmundriya asked Jan 2
1,015 views
MIT HOMEWORK QUESTION | MULTILEVEL PAGING |OPERATING SYSTEM
A three-level hierarchical page table is used for a system with a 44-bit virtual address divided as follows:Field Bits1st-level index VA[43:33] (11 bits...