What does the “big O” notation represent in time complexity analysis ?

Big O notation represents the upper bound of an algorithm's time complexity, describing how runtime grows relative to input size as it approaches infinity. It focuses on worst-case scenarios and ignores constant factors or lower-order terms to provide a high-level performance estimate.