1 concept
Big-O notation expresses algorithm complexity as growth rate relative to input size. Represents worst case.