Register

Cormen Edition 3 Exercise 4.4 Question 1 (Page No. 92)

176 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
akash.dinkar12 asked Apr 5, 2019
212 views
Cormen Edition 3 Exercise 4.4 Question 2 (Page No. 92)
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
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
User Avatar
0 votes
0 votes
0 answers
2
akash.dinkar12 asked Jun 28, 2019
333 views
Cormen Edition 3 Exercise 7.4 Question 1 (Page No. 184)
Show that in the recurrence $T(n)=\max_{0<q\leq n-1} (T(q)+T(n-q-1))+\Theta(n)$ $T(n)=\Omega(n^2)$
Show that in the recurrence$T(n)=\max_{0<q\leq n-1} (T(q)+T(n-q-1))+\Theta(n)$$T(n)=\Omega(n^2)$
User Avatar
0 votes
0 votes
0 answers
3
akash.dinkar12 asked Apr 5, 2019
149 views
Cormen Edition 3 Exercise 4.3 Question 1 (Page No. 87)
Show that the solution of $T(n) = T(n-1)+ n$ is $O(n^2)$
Show that the solution of $T(n) = T(n-1)+ n$ is $O(n^2)$
User Avatar
Link Copied!