theorem Master - Wikipedia, the free encyclopedia
http://en.wikipedia.org/wiki/Master_theorem
Help us provide free content to the world by donating today!
Master theorem
From Wikipedia, the free encyclopedia
In the analysis of algorithms, the master theorem, which is a specific case of the Akra-Bazzi theorem, provides a cookbook solution in asymptotic terms for recurrence relations of types that occur in practice. It was popularized by the canonical algorithms textbook Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein, which introduces and proves it in sections 4.3 and 4.4, respectively. Nevertheless, not all recurrence relations can be solved with the use of the master theorem.
Contents
1 Generic form 2 Case 1 2.1 Generic form 2.2 Example 3 Case 2 3.1 Generic form 3.2 Example 4 Case 3 4.1 Generic form 4.2 Example 5 Inadmissible[1] 6 See also 7 References 8 External links
Generic form
The master theorem concerns recurrence relations of the form:
In the application to the analysis of a recursive algorithm, the constants and function take on the following significance: n is the size of the problem. a is the number of subproblems in the recursion. n/b is the size of each subproblem. (Here it is assumed that all subproblems are essentially the same size.) f (n) is the cost of the work done outside the recursive calls, which includes the cost of dividing the problem and the cost of merging the solutions to the subproblems. It is possible to determine an asymptotic tight bound in these three cases:
1 of 6
10/8/2008 11:42 AM
Master theorem - Wikipedia, the free encyclopedia
http://en.wikipedia.org/wiki/Master_theorem
Case 1
Generic form
If it is true that it follows that: for some constant > 0
Example
As one can see in the formula above, the variables get the following values: , , ,
Now we have to check that the following equation holds:
If we insert the values from above, we get:
If we choose = 1, we get:
Since this equation holds, the first case of the master theorem applies to the given recurrence relation, thus resulting in the conclusion:
If we insert the values from above, we finally get:
Thus the given recurrence relation T(n) was in (n). (This result is confirmed by the exact solution of the recurrence relation, which is T(n) = 1001n3 1000n2, assuming T(1) = 1.)
Case 2
2 of 6
10/8/2008 11:42 AM
Master theorem - Wikipedia, the free encyclopedia
http://en.wikipedia.org/wiki/Master_theorem
Generic form
If it is true that:
it follows that:
Example
As we can see in the formula above the variables get the following values: , , , ,
Now we have to check that the following equation holds (in this case k=0):
If we insert the values above, from we get:
Since this equation holds, the second case of the master theorem applies to the given recurrence relation, thus resulting in the conclusion:
If we insert the values from above, we finally get:
Thus the given recurrence relation T(n) was in (n log n). (This result is confirmed by the exact solution of the recurrence relation, which is T(n) = n + 10nlog2n, assuming T(1) = 1.)
Case 3
Generic form
If it is true that:
3 of 6
10/8/2008 11:42 AM
Master theorem - Wikipedia, the free encyclopedia
http://en.wikipedia.org/wiki/Master_theorem
for some constant > 0 and if it is also true that: for some constant c < 1 and sufficiently large n it follows that:
Example
As we can see in the formula above the variables get the following values: , , ,
Now we have to check that the following equation holds:
If we insert the values from above, and choose = 1, we get:
Since this equation holds, we have to check the second condition, namely if it is true that:
If we insert once more the values from above, we get:
If we choose
, it is true that:
So it follows:
If we insert once more the necessary values, we get:
4 of 6
10/8/2008 11:42 AM
Master theorem - Wikipedia, the free encyclopedia
http://en.wikipedia.org/wiki/Master_theorem
Thus the given recurrence relation T(n) was in (n), that complies with the f (n) of the original formula. (This result is confirmed by the exact solution of the recurrence relation, which is T(n) = 2n2 n, assuming T(1) = 1.)
Inadmissible[1]
The following equations cannot be solved using the master theorem.
a is not a constant
non-polynomial difference between f(n) and
a<1 cannot have less than one sub problem
f(n) is not positive
case 3 but regularity violation
See also
Big O notation
References
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0-262-03293-7. Sections 4.3 (The master method) and 4.4 (Proof of the master theorem), pp.7390.
1. ^ http://www.cag.lcs.mit.edu/~thies/6.046-web/master.pdf
5 of 6
10/8/2008 11:42 AM
Master theorem - Wikipedia, the free encyclopedia
http://en.wikipedia.org/wiki/Master_theorem
External links
Retrieved from "http://en.wikipedia.org/wiki/Master_theorem" Categories: Asymptotic analysis Mathematical theorems Recurrence relations This page was last modified on 6 October 2008, at 08:25. All text is available under the terms of the GNU Free Documentation License. (See Copyrights for details.) Wikipedia is a registered trademark of the Wikimedia Foundation, Inc., a U.S. registered 501(c)(3) tax-deductible nonprofit charity.
6 of 6
10/8/2008 11:42 AM