title: Asymptotic complexity of T(n)=T(n-1)+1/n
body: <p>There is an algorithm which has the time complexity</p>
  
  <pre><code>    T(n)=T(n-1)+1/n if n&gt;1
          =1          otherwise
  </code></pre>
  
  <p>I am solving for its asymptotic complexity, and getting order as 'n' but the answer given is 'log n'. Is it correct? If it is log n, then why?</p>