How to solve recursion using Substitution Method
I have the following recursion that I need to solve it using Substitution Method:

    T(n)=T(n-1)+1/n
I know that we have to guess the form of solution and verify it using the induction.

I guess the form `O(n log n)` such that

    T(n) <= c n log n
    T(n-1) <= c(n-1)log(n-1)+1/n
    T(n-1) <= cn - c log(n-1)+1/n
When I reached this point, I could not complete because I have no idea what I should do after that.

Can someone help me with that? At least, give me some hints.

Thanks
How to solve recursion using Substitution Method
===

I have the following recursion that I need to solve it using Substitution Method:

    T(n)=T(n-1)+1/n
I know that we have to guess the form of solution and verify it using the induction.

I guess the form `O(n log n)` such that

    T(n) <= c n log n
    T(n-1) <= c(n-1)log(n-1)+1/n
    T(n-1) <= cn - c log(n-1)+1/n
When I reached this point, I could not complete because I have no idea what I should do after that.

Can someone help me with that? At least, give me some hints.

Thanks