Big-o notation

Big-O notation is a mathematical notation used to describe the upper bound of an algorithm's running time or space requirements in terms of the input size. It provides a high-level understanding of the algorithm's efficiency and scalability by categorizing its performance as it approaches large input sizes.