# Algorithm Analysis

We can analyze the performance of an algorithm based on its time complexity. Time complexity serves as a platform-independent measure of an algorithm's performance.

The following sections describe asymptotic notations and the Master Theorem to analyze the time complexity of recurrence relations.