Register

Master theorem

328 views
1 1 vote
When can we can't apply master theorem.ghive some examples with explanation?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Inverse of a functio...Next → · testbook test series
← Previous in category · asymptotic function ...Next in category → · algorithm
Position:
Show:

Related questions

5 5 votes
4 4 answers
1.2k
1.2k views
NullPointer_Pro asked Dec 24, 2025
1,155 views
GATE CS Practice : The "Master Theorem" (Algorithms)
Consider the following recurrence relation describing the running time of an algorithm: $$T(n) = 2T\left(\frac{n}{2}\right) + \frac{n}{\log n}$$$$(Base\ condition: T(1) =...
0 0 votes
1 1 answer
316
316 views
arbpass asked Sep 11, 2025
316 views
Algorithm Master Theorem
How to check if f(n) is polynomially greater than g(n)?
1 1 vote
0 0 answers
276
276 views
Mitlesh_Verma asked Aug 15, 2025
276 views
T(n)= 2T(n^1/2)+(log n/log log n) solve this using master theorem
0 0 votes
1 answers 1 answer
1.1k
1.1k views
dhruba asked May 29, 2023
1,071 views
Consider a divide and conquer algorithm that divides an input of size n into a subproblems, each of size n/b, and the cost of dividing and merging the problems is given by f(n) = Θ(n^c). The Master Theorem classifies this into different cases based on the value of c in relation to log_b(a). Could you explain the intuition and reasoning behind these classifications?
Consider a divide and conquer algorithm that divides an input of size n into a subproblems, each of size n/b, and the cost of dividing and merging the problems is given b...