Dark Mode

Recent questions tagged master-theorem

0 votes

1 answer

91

Algorithms: Master Method Testbook

Prasanna asked in Algorithms Jan 18, 2016

447 views

1 vote

0 answers

92

How to Solve Questions based on varients of Master Method
T(n) = a1 T(n/b) + a2 T(n/b) eg T(n) = T(n/4) + T(3n/4) + n

pC asked in Algorithms Dec 20, 2015

by pC

622 views

3 votes

2 answers

93

Time complexity
How to apply Master's Theorem (i) $T(n)= T(\frac{n}{2})+2^{n}$ (ii) $T(n)=2^{n}T(\frac{n}{2})+n^{n}$

tiger asked in Algorithms Dec 15, 2015

by tiger

1.2k views

2 votes

3 answers

94

Find complexity of T(n)=64T(n/8)-n^2lgn
Which is right method to apply for this substitute or recursion... Can we convert it in master theorem format

sabir asked in Algorithms Nov 26, 2015

by sabir

13.3k views

3 votes

1 answer

95

Recurrence: How to approach
Solve Recurrence A) T(n) = T( √ n) + Θ(lg lg n) B) T(n) = T(n/2 + √ n) + √ 6046 C) T(n) = T(n − 2) + lg n D) T(n) = √ n T( √ n) + 100n

Prasanna asked in Algorithms Nov 26, 2015

1.6k views

2 votes

2 answers

96

substitution or Master Method
What to use for this Master or Substitution Method ? T(1) = 1, and for all n ≥ 2 a power of 2, T(n)=2T(n/2) + 6n − 1. If it is possible in Master Method how ? Even,Substitution is also accecpted here. Edit: In substitution Method Suppose T(1) = 1, and ... = n + 6n log n − (2log n − 1) = 6n log n + 1.

Prasanna asked in Algorithms Nov 25, 2015

1.7k views

1 vote

1 answer

97

Recurrence relation
How to solve the Recurrence relation T(n)=T(n/4)+T(3n/4)+n

Soumyashree asked in Algorithms Nov 21, 2015

455 views

2 votes

3 answers

98

Master theorem details?
There are different versions of master theorem available. I want to know whether the version given in Cormen book is sufficient for GATE?

shikharV asked in Algorithms Nov 17, 2015

2.7k views

2 votes

1 answer

99

Can these be solved by Master's theorem?
1) $T(n)=T(n/2)+2^n$ 2) $T(n)=2T(n/2)+n / \log n$ 3) $T(n)=16T(n/4)+n!$ 4) $T(n)= \sqrt 2T ( n/2 ) + \log n$

Himani Srivastava asked in Algorithms Nov 4, 2015

by Himani Srivastava

3.8k views

0 votes

3 answers

100

Master Theorem
When do we say that 2 functions are polynomially comparable for applying master theorem...? We can apply the theorem for T(n)=3T(n/4)+nlgn but cant apply it for T(n)=2T(n/2)+nlgn ...please explain..?

dhingrak asked in Algorithms Jan 18, 2015

856 views

Page:

« prev
1
2
3
4

Recent questions tagged master-theorem