edited by
1,396 views
0 votes
0 votes

Let $T(n) = T(n-1) + \frac{1}{n} , T(1) = 1 ;$ then $T(n) = ? $

  1. $O(n^{2})$
  2. $O(logn)$
  3. $O(nlogn)$
  4. $O(n^{2}logn)$
edited by

2 Answers

2 votes
2 votes

......

this is the way to dealing with such type of question 

 

 

 

 

 

 

Related questions

1 votes
1 votes
2 answers
1
aditi19 asked May 14, 2019
821 views
What will be solution of recurrence relation if roots are like this: r1=-2, r2=2, r3=-2, r4=2is this the case of repetitive roots?
0 votes
0 votes
0 answers
2
22 votes
22 votes
1 answer
3
P C asked Dec 31, 2022
1,471 views
What is the recurrence relation for the ternary strings of length $n$ which can be constructed using 0,1 or 2 only such that the number of 0’s and number of 1's is od...
0 votes
0 votes
0 answers
4