Register

Algo cormen Time complexity

• retagged by
427 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

1.5k
views
1 answers
2 votes
Manu Thakur asked Aug 18, 2017
1,537 views
Coreman: Time Complexity
Can you please solve this following question further?What will be the time complexity?
User Avatar
350
views
0 answers
0 votes
akash.dinkar12 asked Jun 28, 2019
350 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)$
User Avatar
313
views
1 answers
0 votes
akash.dinkar12 asked Jun 27, 2019
313 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)$.
User Avatar
629
views
1 answers
0 votes
akash.dinkar12 asked Jun 26, 2019
629 views
Cormen Edition 3 Exercise 2.3 Question 3 (Page No. 39)
Use mathematical induction to show that when $n$ is an exact power of $2$ ... $,for k >1} \end{cases}$is $T(n) = n\ lg\ n$.
User Avatar
Link Copied!