Big O Notation: It is a way to describe the performance or efficiency of an algorithm by analyzing its growth rate as the input size increases.
Time Complexity: It measures how much time an algorithm takes to run as a function of the input size.
Space Complexity: It measures how much memory an algorithm uses as a function of the input size.