Masters Theorem for Decreasing Function
T(n)=a T(n-b) +f(n)
case 1: if a less than 1 then T(n)=O(f(n))
case 2: if equal 1 then T(n)=O(n*f(n))
case 3: if a greater than 1 then T(n)=O(f(n) a n/b)
PATREON : https://www.patreon.com/bePatron?u=20475192
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
