Register

Master Theorem

571 views
1 votes
1 votes
T(n) = 2T(n/2) + nlogn

a. O(nlogn)

b.n(log^2n)

c.O(n^2)
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
mdboi asked Oct 28, 2022
749 views
𝑇(𝑛)=16𝑇(𝑛/4)+5𝑛^3 using the master theorem
how do i apply master theorem to this? 𝑇(𝑛)=16𝑇(𝑛/4)+5𝑛^3
how do i apply master theorem to this? 𝑇(𝑛)=16𝑇(𝑛/4)+5𝑛^3
User Avatar
2 votes
2 votes
1 answer
2
iarnav asked Jan 11, 2018
1,114 views
recurrence using Master theorem
can we solve this T(n) = T(n/2) + 1 using master theorem?
can we solve this T(n) = T(n/2) + 1 using master theorem?
User Avatar
3 votes
3 votes
0 answers
3
Sona Barman asked Jan 8, 2018
2,318 views
Master theorem and extended Master theorem
I have doubt regarding Master theorem.In which situation we should use Normal Master theorem/extended Master theorem?
I have doubt regarding Master theorem.In which situation we should use Normal Master theorem/extended Master theorem?
User Avatar
0 votes
0 votes
0 answers
4
aka 53 asked Nov 22, 2017
353 views
Master theorem
T(n) = T(n-1) + n In which case it falls ??
T(n) = T(n-1) + nIn which case it falls ??
User Avatar
Link Copied!