Analysis of Algorithms is the determination of the amount of time, storage, and/or other resources necessary to execute them. Analyzing algorithms is called Asymptotic Analysis, which evaluates the performance of an algorithm. Time complexity of an algorithm quantifies the amount of time taken by an algorithm. Three cases can be analyzed for an algorithm: Worst Case, Average Case.