Big O Notation is a mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity.

<aside> 💡 In simple it is used to describe the performance of an algorithm.

</aside>

• O(1) - Constant Time:
• O(n) - Linear Time:
• O(n^2) - Quadratic Time:
• O(log n) - Logarithmic Time:
• O(2^n) - Exponential Time: