algorithm - Recurrence: T(n) = 3T(n/2) + n^2(lgn) -
here full question...
analysis of recurrence trees. find nice nonrecursive function f (n) such t(n) = Θ( f (n)). show work: number of levels, number of instances on each level, work of each instance , total work on level.
this homework question not expect exact answers, guidance because have no idea start. here part a:
a) t(n) = 3t(n/2) + n^2(lgn)
i have no idea begin.
these types of recurrences solved master's theorem
in case a=3
, b=2
, therefore c = log2(3) < 2
.
so in third case , complexity o(n^2 * log(n))
Comments
Post a Comment