Register

Algo cormen Time complexity

• retagged by
400 views

1 Answer

1 votes
1 votes

Complexity would be  : C*(n-1) + d reduce it asymptotically according to C and d.

• edited by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
Manu Thakur asked Aug 18, 2017
1,453 views
Coreman: Time Complexity
Can you please solve this following question further? What will be the time complexity?
Can you please solve this following question further?What will be the time complexity?
User Avatar
0 votes
0 votes
0 answers
2
akash.dinkar12 asked Jun 28, 2019
334 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
1 answer
3
akash.dinkar12 asked Jun 27, 2019
301 views
Cormen Edition 3 Exercise 7.2 Question 1 (Page No. 178)
Use the substitution method to prove that the recurrence $T(n)=T(n-1) + \Theta(n)$ has the solution $T(n) =\Theta(n^2)$.
Use the substitution method to prove that the recurrence $T(n)=T(n-1) + \Theta(n)$ has the solution $T(n) =\Theta(n^2)$.
User Avatar
Link Copied!