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 Black.
Entry modified 20 January 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Sandeep Kumar Shukla, "Master theorem", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 20 January 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/mastertheorm.html