algorithm - master theorem and recurrence -
i given recurrence t(n) = 3t(n/2) + n^2 lg(n)
is possible use master theorem find t(n) = theta(f(n))? there polylogarithmic function f(n) understand there limited 4th case. 4th case apply here?
master's theorem not have constrains regards f(n) function:
so = 3, b = 2, c = log2(3), , fall in third case , solution o(n^2 log n)
Comments
Post a Comment