How do you calculate a tight bound run time for these relations? T(n)=T(n-3)+n^2 T(n) = 4T(n/4)+log^3(n) For the first one I used the substitution method which gave me n^2 but wasn't right and the second one I used Masters Theorem and got nlog^4(n) wh

mathematics

Description

How do you calculate a tight bound run time for these relations? T(n)=T(n-3)+n^2 T(n) = 4T(n/4)+log^3(n) For the first one I used the substitution method which gave me n^2 but wasn't right and the second one I used Masters Theorem and got nlog^4(n) which also wasn't right. A thorough explanation would be helpful. Thanks!


Related Questions in mathematics category


Disclaimer
The ready solutions purchased from Library are already used solutions. Please do not submit them directly as it may lead to plagiarism. Once paid, the solution file download link will be sent to your provided email. Please either use them for learning purpose or re-write them in your own language. In case if you haven't get the email, do let us know via chat support.