0 votes 0 votes Show that if $f(n)=\Theta(n^{log_ba}\lg^kn )$, where $k\geq0$ then the master recurrence has solution $T(n) =\Theta(n^{log_ba} \lg^{k+1}n)$.For simplicity, confine your analysis to exact powers of $b$. Algorithms cormen algorithms recurrence-relation master-theorem descriptive difficult + – akash.dinkar12 asked Apr 5, 2019 akash.dinkar12 215 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.