Register

cormen

• retagged by
788 views
0 0 votes
Find T.C

T(n)=T(n-1)+1/n;

t(n)=constant ifn<=2;

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · cormenNext → · ISRO 2012- [Mech] Ca...
← Previous in category · cormenNext in category → · algorithm, Sorting
Position:
Show:

Related questions

0 0 votes
1 1 answer
897
897 views
akash.dinkar12 asked Jun 26, 2019
897 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$, the solution of the recurrence$T(n) = \begin{cases} 2 \text{, if n=2, } ...
0 0 votes
0 0 answers
655
655 views
akash.dinkar12 asked Jun 28, 2019
655 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)$
0 0 votes
1 1 answer
519
519 views
akash.dinkar12 asked Jun 27, 2019
519 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)$.
0 0 votes
0 0 answers
500
500 views
akash.dinkar12 asked Apr 5, 2019
500 views
Cormen Edition 3 Exercise 4.6 Question 3 (Page No. 106)
Show that case 3 of the master theorem is overstated, in the sense that the regularity condition $af(n/b)\geq cf(n)$ for some constant $c<1$ implies that there exists a c...