1 votes 1 votes how to solve the recurrence relation T(n)=16T(n/4)+n^2+nlogn Programming in C recurrence-relation asymptotic-notation + – Murali asked Jan 22, 2016 retagged Jun 4, 2017 by Arjun Murali 480 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes http://cse.unl.edu/~choueiry/S06-235/files/MasterTheorem.pdf Banti Arya answered Jan 30, 2016 Banti Arya comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes n^2 logn as the leading term of n^2+n*logn polynomial is n^2 ...and it will be some special case of masters theorem ... Deepesh Kataria answered Feb 1, 2016 Deepesh Kataria comment Share Follow See all 0 reply Please log in or register to add a comment.