Big O notation

Big O notation is a mathematical notation used to describe the upper bound of an algorithm’s growth rate in terms of time or space complexity, expressing how the algorithm’s performance scales with input size.

---