Register

Recent questions tagged master-theorem

0 0 votes
0 0 answers
661
661 views
Self Doubt
T(n)=4T(√n)+nHow can we solve it using master theorem using subsitution and renaming.
User Avatar
0 0 votes
0 0 answers
753
753 views
Doubt - Source : Stack_Overflow
How the case is matched ? : T(n) = 2T(n/2) + O(n * m)we have a = 2, b = 2, c = 1 and c = $Log_ba$ (case 2)Hence, T(n) = O(n * m * log n)Now, substituting m with nT(n) =...
User Avatar
0 0 votes
1 1 answer
591
591 views
madeeasy
how to apply masters theorem in this type of cases!????!
User Avatar
0 0 votes
1 1 answer
704
704 views
recurrence equation:
T(1) = 1 T(n) = 2T(n - 1) + n, n ≥ 2 evaluates to(a) 2n + 1 - n – 2(b) 2n – n(c) 2n + 1 – 2n – 2(d) 2n – n HOW TO EVALUATES USING MASTER THEOREM
User Avatar
0 0 votes
0 0 answers
3.0k
3.0k views
Master's theorem
User Avatar
2 2 votes
6 6 answers
26.8k
26.8k 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...
User Avatar
0 0 votes
2 answers 2 answers
1.8k
1.8k views
Self doubt
How to solve the given recurrence relation using master's theorem?T(n)=T(${n^{1/2}}$)+n
User Avatar
0 0 votes
2 2 answers
588
588 views
Analysis of the algorithms
T(n) = 3T( n/3 ) + n/2The answer to the above question says that case 2 of masters theorem is applied here. How is it so?
User Avatar
0 0 votes
1 1 answer
893
893 views
Time complexity
T(n)=T(n-1)+O(n)Can we apply master's theorem here ??
User Avatar
0 0 votes
0 0 answers
1.5k
1.5k views
Master's Theorem Recurrence Relation
T (n) = T (n/2) + 2nUsing Master's Method What is the Complexity Of This Recurrence Relation?Or Using AnyOther Method?
User Avatar
1 1 vote
2 2 answers
3.9k
3.9k views
MadeEasy Subject Test: Algorithms - Recurrence
which of the following cannot be solved using masters theorem?a) T(n) = 2T(n/2) + n/lognb) T(n) = 2T(n/2) + lognc)T(n)=T(n/2)+lognd) non of these
User Avatar
0 0 votes
2 2 answers
4.2k
4.2k views
masters theorem
Solution using back substitution methodT(n) = 2T(n/2) + nlogn ?detailed solution please.ans is nlognlogn or n(logn)^2
User Avatar
0 0 votes
0 0 answers
2.3k
2.3k views
self doubt
consider the following c program AA(n){ if(n<=1) return (n2+n+1);else return ( 5A(n/2)+ 3A(n/2)+n2}find time complexity T(n)=?
User Avatar
0 0 votes
1 1 answer
3.3k
3.3k 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.
User Avatar
0 0 votes
0 0 answers
1.5k
1.5k views
Master theorem rules
On which of the following recurrence relation Master Theorem cannot be applied?a) T(n)=2T(n/2)+nlognb) T(n)=T(n/2)+1c) T(n)=8T(n/2)+lognd) T(n)=7T(n/4)+n^2
User Avatar
0 0 votes
1 1 answer
2.9k
2.9k views
Introduction To Algorithms
T(N) = 3T(N/4) + NlogNT(N) = 2T(N/2)+ NlogNMaster theorem applicable to this ??
User Avatar
0 0 votes
1 1 answer
1.2k
1.2k views
Masters theorem
Solve by using master's theorem
User Avatar
0 0 votes
2 answers 2 answers
1.2k
1.2k views
Time complexity
Find the time complexity using Master's theorem : (Also mention if Master's theorem can't be applied why not?)T(n)=2T(n/2)+nlogn
User Avatar
0 0 votes
3 3 answers
1.7k
1.7k views
Masters theorem
Solve using Master's Theorem$T(n)=T(n/2)+$ 2n
User Avatar
0 0 votes
3 3 answers
1.1k
1.1k views
Made easy work book
How to solve T (n)=T (sqrt n)+ n
User Avatar
1 1 vote
1 1 answer
739
739 views
Master method
Que-4. Master's theorem can be applied on which of the following recurrence relation?$T(n)=2 T(n / 2)+2^{\wedge} n$$T(n)=2 T(n / 3)+\sin (n)$$T(n)=T(n-2)+2 n^{\wedge} 2+1...
User Avatar
3 3 votes
1 answers 1 answer
4.8k
4.8k views
Extended Master's Theorem $T(n)=n^{1/2}T(n^{1/2})+n$
Can Extended Masters theorem be applied to the following recursive equation ?$T(n)=n^{1/2}T(n^{1/2})+n$I solved this using back substitution and the time complexity came ...
User Avatar
7 7 votes
3 3 answers
2.8k
2.8k views
Time complexity , Recursion
Why is recursive equation of following code $T(n)=T(n/2)+O(1)$, not $T(n)=8*T(n/2)+O(1)$? int x=0; int A(n) { if(n==1) return 1; else { X+=8A(n/2)+n^3; } return X; }
User Avatar
0 0 votes
2 2 answers
1.1k
1.1k views
Master's theorem
Can master's theorem be applied if b=1? Or strictly when b>1?
User Avatar
0 0 votes
1 1 answer
429
429 views
Uttrakhand Asst. Professor Exam-62
The running time of an algorithm $T(n)$, where $n$ is the input size, is given by following:$T(n) = \begin{cases} 8T(n/2) + qn & \text{ if } n>1 \\ p & \text{ if } n = 1...
User Avatar
2 2 votes
1 answers 1 answer
2.0k
2.0k views
recurrence using Master theorem
can we solve this T(n) = T(n/2) + 1 using master theorem?
User Avatar
1 1 vote
1 1 answer
1.3k
1.3k views
solve this
$T(n) = 2t(\frac{n}{2}) + \frac{n}{\log n } ; T(1 ) =1$
User Avatar
9 9 votes
2 2 answers
17.2k
17.2k views
T(n) = T(n/4) + T(3n/4) +n
How to solve above recurrence relation (With substitution method)??
User Avatar
3 3 votes
0 0 answers
2.6k
2.6k 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?
User Avatar
2 2 votes
1 answers 1 answer
1.1k
1.1k views
Ace Test series: Algorithms - Recurrence
User Avatar
Page: