2.1.3 Recurrence Relation (T(n)= T(n-1) + log n) #3

Recurrence Relation for Decreasing Function
Example : T(n)= T(n-1) + log n

Courses on Udemy
================
Java Programming
https://www.udemy.com/course/java-se-programming/?referralCode=C71BADEAA4E7332D62B6

Data Structures using C and C++
https://www.udemy.com/course/datastructurescncpp/?referralCode=BD2EF8E61A98AB5E011D

C++ Programming
https://www.udemy.com/course/cpp-deep-dive/?referralCode=E4246A516919D7E84225