If you’re a computer science student or a programmer you may be familiar with term algorithm and time complexity related to a computer program so in this article you’re going to learn about MASTER THEOREM – Analysis of Algorithm.

We use master theorem for given recursive equation. If we have recursive equation then by using master’s theorem we can easily find out the time complexity of the recursive equation of a program. generally finding time complexity is tidious task but with master’s theorem you’ll be master in it.

Everything comes with certain conditions so using master theorem is not completely straight forward it has certain limitations and conditions.