ASYMPTOTIC NOTATION

Asymptotic Notation is a way to describe the behaviour of a function as their inputs become arbitrarily large in size or indefinite. Its commonly used in Computer science and mathematics to analyse algorithms and its efficiency.

Some notations are commonly used:

     Big O notation:

Describes the upper bound or the worst-case scenario functions of a growth rate.

Omega notation:

Describes the lower or the best-case scenario of a function’s growth rate.

Theta notation:

Describes the both the upper and lower bounds of a function’s growth rate, indicating tight bounds.

These notations are used to analyse algorithms time complexity and space complexity, helping to understand how their performance scales with input size.