ANALYSIS OF ALGORITHM
In computer science, the analysis of algorithms is the determination of the amount of resources (such as time and storage) necessary to execute them.
Space Complexity Analysis: It represents the amount of storage space required by an algorithm during the course of its execution.
Time Complexity Analysis: It represents the amount of time taken by an algorithm during the course of its execution.
ASYMPTOTIC NOTATIONS
Asymptotic Notations allow us to analyze an algorithm's running time (or space) by identifying its behavior as the input size for the algorithm increases. This is also known as an algorithm's growth rate.
TYPES OF ASYMPTOTIC NOTATIONS
1. Big Oh
2. Big Omega
3. Big Theta
4. Little Oh
5. Little Omega
