Definition: A theorem giving a solution in asymptotic terms for recurrence relations of the form T(n) = aT(n/b) + f(n) where a ≥ 1 and b > 1 are constants and n/b means either n/b or n/b.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 20 January 2004.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Sandeep Kumar Shukla, "Master theorem", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 20 January 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/mastertheorm.html