Register

Solve using Masters theorem

• edited by
410 views

1 Answer

Best answer
1 votes
1 votes

T(n) =T (n/2)+ n

a= 1 b = 2 

Using 2nd case of Master's theorem

nlogba  < n 

nlog 2 1 < n 

θ (n)

• edited by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
2 answers
2
sh!va asked Oct 29, 2016
2,121 views
Solve using Masters theorem
Solve using Masters theorem 2T (n/2) + n log n
Solve using Masters theorem 2T (n/2) + n log n
User Avatar
2 votes
2 votes
4 answers
3
sh!va asked Oct 29, 2016
2,551 views
Solve using Master's theorem
Solve this recurrence equation using Master's theorem T(n) = 64 T(n/8) - n 2 log n
Solve this recurrence equation using Master's theoremT(n) = 64 T(n/8) - n 2 log n
User Avatar
1 votes
1 votes
1 answer
4
ItzDc asked Jun 3, 2022
3,003 views
Solve equation using master theorem T(n) = 8T(n/2) + 3n^2
I can't figure out how to proceed and which case it's falling under after calculating h(n)
I can't figure out how to proceed and which case it's falling under after calculating h(n)
User Avatar
Link Copied!