Register

Master's Theorem Recurrence Relation

• edited by
1,559 views
0 0 votes

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

Using Master's Method What is the Complexity Of This Recurrence Relation?

Or Using AnyOther Method?

 

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · countabilityNext → · Self doubt
← Previous in category · Self doubtNext in category → · Binary Search
Position:
Show:

Related questions

2 2 votes
6 6 answers
26.9k
26.9k views
mohitrai0_0 asked Sep 28, 2018
26,890 views
Can we solve the recurrence T(n) = T(n/2) + 2^n by masters theorem, if possible?
I was wondering whether the recurrence T(n) = T(n/2) + 2n could be solved by using master theorem, and what would be the way. I tried solving the recurrence but can't. Th...
0 0 votes
2 2 answers
4.2k
4.2k views
manvi_agarwal asked Aug 10, 2018
4,208 views
masters theorem
Solution using back substitution methodT(n) = 2T(n/2) + nlogn ?detailed solution please.ans is nlognlogn or n(logn)^2
0 0 votes
1 1 answer
3.4k
3.4k views
Rahul Ranjan 1 asked Aug 6, 2018
3,427 views
Masters Theorem
How can we apply Masters theorem to these equations : T(n) = 16*T(n/4) + n!and T(n) = 4*T(n/2) + cnPlease explain the process.
0 0 votes
1 1 answer
1.2k
1.2k views
bts asked Jul 17, 2018
1,207 views
Masters theorem
Solve by using master's theorem