Scribd
Upload
98 views5 pages

Master Theorem

The master theorem is a method for solving recurrence relations of the form T(n) = aT(n/b) + f(n), where n is the size of the input, a is the number of subproblems in the recursion, and n/b is the size of each subproblem. All subproblems are assumed to be the same size. The master theorem provides a formulaic approach to determining the runtime of algorithms described by such recurrence relations.

Uploaded by

Muhammad hanzla
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
98 views5 pages

Master Theorem

The master theorem is a method for solving recurrence relations of the form T(n) = aT(n/b) + f(n), where n is the size of the input, a is the number of subproblems in the recursion, and n/b is the size of each subproblem. All subproblems are assumed to be the same size. The master theorem provides a formulaic approach to determining the runtime of algorithms described by such recurrence relations.

Uploaded by

Muhammad hanzla
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Master Theorem

Master Theorem
• The master method is a formula for solving recurrence relations of the
form: T(n) = aT(n/b) + f(n), where, n = size of input a = number of
subproblems in the recursion n/b = size of each subproblem. All
subproblems are assumed to have the same size
Master Theorem
Examples
Examples (Cont.)

You might also like