The Gateway to Computer Science Excellence
0 votes
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
in Algorithms by Boss (41.9k points) | 19 views

1 Answer

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

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,647 questions
56,492 answers
195,471 comments
100,767 users