19 views
Use a recursion tree to determine a good asymptotic upper bound on the recurrence $T(n)=T(n/2)+n^2$.Use the substitution method to verify your answer
| 19 views

For this one we can apply Master's theorem simply.
by (173 points)