Register

Recent questions tagged master-theorem

1 votes
2 answers
31
MadeEasy Subject Test: Algorithms - Recurrence
which of the following cannot be solved using masters theorem? a) T(n) = 2T(n/2) + n/logn b) T(n) = 2T(n/2) + logn c)T(n)=T(n/2)+logn d) non of these
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 votes
2 answers
32
masters theorem
Solution using back substitution method T(n) = 2T(n/2) + nlogn ? detailed solution please. ans is nlognlogn or n(logn)^2
Solution using back substitution methodT(n) = 2T(n/2) + nlogn ?detailed solution please.ans is nlognlogn or n(logn)^2
User Avatar
0 votes
0 answers
33
self doubt
consider the following c program A A(n) { if(n<=1) return (n2+n+1); else return ( 5A(n/2)+ 3A(n/2)+n2 } find time complexity T(n)=?
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 votes
1 answer
34
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) + cn Please explain the process.
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 votes
0 answers
35
Master theorem rules
On which of the following recurrence relation Master Theorem cannot be applied? a) T(n)=2T(n/2)+nlogn b) T(n)=T(n/2)+1 c) T(n)=8T(n/2)+logn d) T(n)=7T(n/4)+n^2
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 votes
1 answer
36
Introduction To Algorithms
T(N) = 3T(N/4) + NlogN T(N) = 2T(N/2)+ NlogN Master theorem applicable to this ??
T(N) = 3T(N/4) + NlogNT(N) = 2T(N/2)+ NlogNMaster theorem applicable to this ??
User Avatar
0 votes
1 answer
37
Masters theorem
Solve by using master's theorem
Solve by using master's theorem
User Avatar
0 votes
2 answers
38
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
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 votes
3 answers
39
Masters theorem
Solve using Master's Theorem $T(n)=T(n/2)+$ 2n
Solve using Master's Theorem$T(n)=T(n/2)+$ 2n
User Avatar
0 votes
3 answers
40
Made easy work book
How to solve T (n)=T (sqrt n)+ n
How to solve T (n)=T (sqrt n)+ n
User Avatar
7 votes
3 answers
43
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; }
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 votes
1 answer
44
#Recurrence_Relation
How to solve this in the simplest way? $T(n) = T(n/4) + T(3n/4) +n$
How to solve this in the simplest way?$T(n) = T(n/4) + T(3n/4) +n$
User Avatar
0 votes
2 answers
45
Master's theorem
Can master's theorem be applied if b=1? Or strictly when b>1?
Can master's theorem be applied if b=1? Or strictly when b>1?
User Avatar
2 votes
1 answer
47
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
1 votes
0 answers
48
solve this
$T(n) = 2t(\frac{n}{2}) + \frac{n}{\log n } ; T(1 ) =1$
$T(n) = 2t(\frac{n}{2}) + \frac{n}{\log n } ; T(1 ) =1$
User Avatar
9 votes
1 answer
49
T(n) = T(n/4) + T(3n/4) +n
How to solve above recurrence relation (With substitution method)??
How to solve above recurrence relation (With substitution method)??
User Avatar
3 votes
0 answers
50
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
1 votes
1 answer
52
Master Theorem
T(n) = 2T(n/2) + nlogn a. O(nlogn) b.n(log^2n) c.O(n^2)
T(n) = 2T(n/2) + nlogna. O(nlogn)b.n(log^2n)c.O(n^2)
User Avatar
0 votes
0 answers
53
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
0 votes
1 answer
55
self doubt apply
can masters theorem be used when base condition is given in a recurrence ? can we directly apply masters theorem to any recurrence ?
can masters theorem be used when base condition is given in a recurrence ?can we directly apply masters theorem to any recurrence ?
User Avatar
2 votes
1 answer
57
master theorem
explain complexity for this
explain complexity for this
User Avatar
1 votes
1 answer
58
master theorem
is the time complexity for this fuction is O(n)?
is the time complexity for this fuction is O(n)?
User Avatar
1 votes
1 answer
60
corman ex
out of these how many can be solved by master method and how to solve questions in which master theorems cant be applied
out of these how many can be solved by master method and how to solve questions in which master theorems cant be applied
User Avatar
Page: