Explain three cases of master theorem.

15kviews

written 7.9 years ago by

teamques10 ★ 65k

• modified 4.1 years ago

ADD COMMENT EDIT

1 Answer

593views

written 7.9 years ago by

teamques10 ★ 65k

The master theorem concerns recurrence relations of the form:

$T(n) = aT\bigg(\frac{n}{b}\bigg) + f(n) \ \ where \ \ a \ge 1, b \gt 1$

In the application to the analysis of a recursive algorithm, the constants and function take on the following significance:

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.