Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged master-theorem
2
votes
1
answer
61
Master Theorem
T(n) = 3T(n/2) + $\sqrt[2]{n+3}$ if n > 1 = d if n = 1 2. T(n) = 3T(n/2) + $\sqrt[2]{n^{4}+3}$ if n > 1 = d if n = 1.
T(n) = 3T(n/2) + $\sqrt {n+3}$ if n 1 = d if n = 1 2. T(n) = 3T(n/2) + $\sqrt {n^{4}+3}$ if n 1 ...
anonymous
498
views
anonymous
asked
Jul 4, 2017
Algorithms
algorithms
master-theorem
+
–
0
votes
1
answer
62
CLR 3rd edition , page no 87, Q.no. 4.3-6
While solving this recurrence T(n) = 2T(n/2 + 17) + n what is the need of 17 and how to go forward to solve this question using the method of master theorem ?
While solving this recurrence T(n) = 2T(n/2 + 17) + n what is the need of 17 and how to go forward to solve this question using the method of master theorem ?
dragonball
369
views
dragonball
asked
Jun 22, 2017
Algorithms
recurrence-relation
master-theorem
+
–
3
votes
1
answer
63
Time Complexity for Recurrence relation
What will be the time complexity for the following recurrence relation? $T(n) = 8\sqrt{n} T(\sqrt{n})+(log n)^{2}$ According to me it is $\Theta (n(logn)^{3})$ . Please confirm.
What will be the time complexity for the following recurrence relation?$T(n) = 8\sqrt{n} T(\sqrt{n})+(log n)^{2}$According to me it is $\Theta (n(logn)^{3})$ . Please con...
Ashish Sharma 3
1.7k
views
Ashish Sharma 3
asked
Jun 16, 2017
Algorithms
time-complexity
recurrence-relation
master-theorem
+
–
2
votes
3
answers
64
Ace practice book
how to apply master's method for this recurrence relation $T\left ( n \right )= {}\sqrt{n}T\left ( {\sqrt{n}} \right )+n$
how to apply master's method for this recurrence relation $T\left ( n \right )= {}\sqrt{n}T\left ( {\sqrt{n}} \right )+n$
Devasish Ghosh
817
views
Devasish Ghosh
asked
May 18, 2017
Algorithms
master-theorem
algorithms
divide-and-conquer
+
–
2
votes
2
answers
65
State and explain master theorem
State and explain master theorem. Can Master’s method be applied to recurrence , $T(n) = 4T(n/2) + n^2logn$ ? Why or why not ?
State and explain master theorem.Can Master’s method be applied to recurrence , $T(n) = 4T(n/2) + n^2logn$ ?Why or why not ?
rahuldb
1.9k
views
rahuldb
asked
May 5, 2017
Algorithms
algorithms
master-theorem
time-complexity
+
–
1
votes
2
answers
66
Master's theorem
We know that Master's theorem is applicable if for the reccurence relation T(n)=aT(n/b) +Θ(n^k log^p n) ,the conditions: a>=1, b>1, k>=0 and p= any real number are satisfied. My doubt is that if k= not a constant( eg: n^n), then can we apply the theorem since we know n will always be positive so k will be positive only?
We know that Master's theorem is applicable if for the reccurence relation T(n)=aT(n/b) +Θ(n^k log^p n) ,the conditions: a>=1, b>1, k>=0 and p= any real number are sati...
Bongbirdie
481
views
Bongbirdie
asked
Mar 4, 2017
Algorithms
master-theorem
algorithms
+
–
3
votes
3
answers
67
T(n)=16T(n/4)+n! using the Master Theorem
how do i apply master theorem to this? https://s17.postimg.org/x7xld2nf3/Screenshot_82.png what is P and K here?
how do i apply master theorem to this?https://s17.postimg.org/x7xld2nf3/Screenshot_82.pngwhat is P and K here?
vishwa ratna
21.2k
views
vishwa ratna
asked
Feb 19, 2017
Algorithms
algorithms
master-theorem
+
–
1
votes
1
answer
68
Algorithm Complexity problem
T(n) = 4T(sqrt(n)) + (logn)^5 Find Time complexity.(n=2^k) Give detailed answer , how to derive it.
T(n) = 4T(sqrt(n)) + (logn)^5Find Time complexity.(n=2^k)Give detailed answer , how to derive it.
parthbkgadoya
620
views
parthbkgadoya
asked
Feb 1, 2017
Algorithms
algorithms
time-complexity
master-theorem
+
–
1
votes
1
answer
69
Master theorem
harshit agarwal
721
views
harshit agarwal
asked
Jan 14, 2017
Algorithms
algorithms
time-complexity
master-theorem
test-series
+
–
2
votes
1
answer
70
Time complexity
reena_kandari
334
views
reena_kandari
asked
Jan 10, 2017
Algorithms
time-complexity
recurrence-relation
algorithms
master-theorem
test-series
+
–
0
votes
3
answers
71
time complexity Master's Theorem problem from CLRS
1) T(n)=T(n-1)+1/n. 2) T(n)=T(n-1) +1/log(n) 3)T(n)=3T((n/3) - 2)+n/2. 4)T(n)=T(n/2)+T(n/4)+T(n/8)+n. Use Masters theorem
1) T(n)=T(n-1)+1/n.2) T(n)=T(n-1) +1/log(n)3)T(n)=3T((n/3) - 2)+n/2.4)T(n)=T(n/2)+T(n/4)+T(n/8)+n.Use Masters theorem
Anmol Verma
1.5k
views
Anmol Verma
asked
Jan 9, 2017
Algorithms
algorithms
time-complexity
master-theorem
+
–
1
votes
1
answer
72
Testbook Test Algorithm Q 10
Anjana Babu
1.1k
views
Anjana Babu
asked
Dec 20, 2016
Algorithms
test-series
testbook-test-series
algorithms
master-theorem
+
–
0
votes
2
answers
73
Master Theorem Algorithm
How is master theorem applicable here?
How is master theorem applicable here?
rahul sharma 5
472
views
rahul sharma 5
asked
Dec 14, 2016
Algorithms
master-theorem
algorithms
time-complexity
test-series
+
–
0
votes
1
answer
74
TestBook Test Series: Algorithms - Time Complexity
how to solve these two using matser thorem. 1. t(n)=2t(√n)+n 2. t(n)=4t(√n)+(logn)^2
how to solve these two using matser thorem.1. t(n)=2t(√n)+n2. t(n)=4t(√n)+(logn)^2
rajan
351
views
rajan
asked
Dec 9, 2016
Algorithms
testbook-test-series
algorithms
time-complexity
master-theorem
+
–
0
votes
1
answer
75
Solve using Masters theorem
Solve given recurrence relation using Masters theorem: T(n) =T (n/2)+ n
Solve given recurrence relation using Masters theorem:T(n) =T (n/2)+ n
sh!va
389
views
sh!va
asked
Dec 4, 2016
Algorithms
recurrence-relation
algorithms
master-theorem
+
–
0
votes
0
answers
76
cormen
So I was calculating average case complexity of the following function using Master's theorem: T(n) = 2T (n/2)+ n/ log n According to http://people.csail.mit.edu/thies/6.046-web/master.pdf Question 7, It says Does not apply (non- ... /homepages.math.uic.edu/~leon/cs-mcs401-s08/handouts/extended_master_theorem.pdf Now which concept to follow in gate?? please any expert check this.
So I was calculating average case complexity of the following function using Master's theorem:T(n) = 2T (n/2)+ n/ log nAccording to http://people.csail.mit.edu/thies/6.04...
sushmita
429
views
sushmita
asked
Dec 4, 2016
Algorithms
algorithms
master-theorem
+
–
2
votes
2
answers
77
Solve using Masters theorem
Solve using Masters theorem 2T (n/2) + n log n
Solve using Masters theorem 2T (n/2) + n log n
sh!va
2.1k
views
sh!va
asked
Oct 29, 2016
Algorithms
algorithms
master-theorem
+
–
2
votes
4
answers
78
Solve using Master's theorem
Solve this recurrence equation using Master's theorem T(n) = 64 T(n/8) - n 2 log n
Solve this recurrence equation using Master's theoremT(n) = 64 T(n/8) - n 2 log n
sh!va
2.5k
views
sh!va
asked
Oct 29, 2016
Algorithms
algorithms
master-theorem
time-complexity
+
–
1
votes
1
answer
79
non applicability of master theorem
in which of the following recurrence relation master theorem can not be applied and why a)T(n)=7T(n/2)+n^2 b)T(n)=7T(n/3)+n^2 c)T(n)=T(9n/10)+n d)T(n)=T(n-1)+n
in which of the following recurrence relation master theorem can not be applied and whya)T(n)=7T(n/2)+n^2b)T(n)=7T(n/3)+n^2c)T(n)=T(9n/10)+nd)T(n)=T(n-1)+n
Aradhana Singh
585
views
Aradhana Singh
asked
Oct 25, 2016
Algorithms
recurrence-relation
master-theorem
+
–
1
votes
1
answer
80
Master theorem
T(n)=3T(n/4)+nlogn In this if we use master theorem then how is f(n)=Ω(nlog43+ϵ) ?
T(n)=3T(n/4)+nlognIn this if we use master theorem then how is f(n)=Ω(nlog43+ϵ) ?
Prerna Chauhan
2.2k
views
Prerna Chauhan
asked
Oct 19, 2016
Algorithms
algorithms
master-theorem
asymptotic-notation
+
–
0
votes
2
answers
81
Master Theorem
Can we solve it using master theorem? T(n)=2T(n/2)+Θ(nlogn)
Can we solve it using master theorem?T(n)=2T(n/2)+Θ(nlogn)
Prerna Chauhan
862
views
Prerna Chauhan
asked
Oct 19, 2016
Algorithms
algorithms
master-theorem
recurrence-relation
+
–
1
votes
1
answer
82
#Algo
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)+n2 I think we can apply on all. But plz correct me with reason.Thanks
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)+n2I think we can a...
Rajesh Pradhan
1.6k
views
Rajesh Pradhan
asked
Oct 14, 2016
Algorithms
algorithms
recurrence-relation
master-theorem
+
–
1
votes
2
answers
83
Algorithm Time compleity
Rahul Jain25
559
views
Rahul Jain25
asked
Oct 7, 2016
Algorithms
algorithms
recurrence-relation
time-complexity
master-theorem
test-series
+
–
3
votes
4
answers
84
Reccurance Relation
Can we apply master theorem on following RR T(n) = 16T(n/4) + n! if yes then how
Can we apply master theorem on following RRT(n) = 16T(n/4) + n!if yes then how
indrajeet
794
views
indrajeet
asked
Aug 3, 2016
Algorithms
recurrence-relation
algorithms
master-theorem
+
–
7
votes
1
answer
85
master theorem
T(n)=4T(n/2)+n/logn this can be solved by master theorem but why t(n)=2t(n/2)+n/logn can't be solved by master theorem ?
T(n)=4T(n/2)+n/lognthis can be solved by master theorem but whyt(n)=2t(n/2)+n/logn can't be solved by master theorem ?
vkm07
4.8k
views
vkm07
asked
Jul 27, 2016
Algorithms
algorithms
recurrence-relation
master-theorem
descriptive
+
–
1
votes
2
answers
86
TestBook Test Series: Algorithms - Time Complexity
On which of the following recurrence relation Masters theorem can not be applied ? A. T(n)= 2T(n/2) + n (log n). B. T(n) = T(n/2) + 1. C. T(n) = 8T(n/2) + (log n). D. T(n) = 7(T(n/4) + n2.
On which of the following recurrence relation Masters theorem can not be applied ?A. T(n)= 2T(n/2) + n (log n).B. T(n) = T(n/2) + 1.C. T(n) = 8T(n/2) + (log n).D. T(n) = ...
vijaycs
1.8k
views
vijaycs
asked
Jul 11, 2016
Algorithms
testbook-test-series
algorithms
time-complexity
master-theorem
+
–
2
votes
1
answer
87
Solve recurrence using Master theorem
$T(a)=0 \hspace{0.2cm} if \hspace{0.2cm} a=1$ $T(a)=2T(a/2) + ak \hspace{0.2cm} if \hspace{0.2cm} a=2^{p}, p>0$ where $a=\frac{n}{k}$ Answer: $\Theta (n \log (\frac{n}{k}))$, This is while (n/k) is power of 2. How can I solve it using master theorem?
$T(a)=0 \hspace{0.2cm} if \hspace{0.2cm} a=1$$T(a)=2T(a/2) + ak \hspace{0.2cm} if \hspace{0.2cm} a=2^{p}, p>0$where $a=\frac{n}{k}$Answer: $\Theta (n \log (\frac{n}{k}))$...
SomnathKayal
818
views
SomnathKayal
asked
Apr 8, 2016
Algorithms
master-theorem
algorithms
time-complexity
+
–
1
votes
1
answer
88
Recurrence, master theorem not applicable
$T(n)=T(2n/3)+1$ Find the order of algorithm?
$$T(n)=T(2n/3)+1$$Find the order of algorithm?
neha singh
2.8k
views
neha singh
asked
Mar 10, 2016
Algorithms
recurrence-relation
master-theorem
+
–
2
votes
1
answer
89
find order of this algorithm?
$T(n)=T(n/2) + n^{1/2}.$
$T(n)=T(n/2) + n^{1/2}.$
neha singh
536
views
neha singh
asked
Mar 10, 2016
Algorithms
recurrence-relation
master-theorem
+
–
0
votes
1
answer
90
How to apply the master theorem to equations containing f(n) other than n^d. For e. g. F(n) = log n.
akshay kapase
252
views
akshay kapase
asked
Feb 1, 2016
Algorithms
algorithms
master-theorem
+
–
Page:
« prev
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register