Master’s Theorem is the best method to quickly find the algorithm’s time complexity from its recurrence relation. This theorem can be applied to decreasing as well as dividing functions, each of which we’ll be looking into detail ahead.