NIST

Master theorem

(definition)

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⌉.

Author: SKS


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 20 January 2004.
HTML page formatted Mon Mar 5 14:59:20 2018.

Cite this as:
Sandeep Kumar Shukla, "Master theorem", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 20 January 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/mastertheorm.html