time complexity

This term is a technical specification used primarily in computer science and mathematics to describe the efficiency of an algorithm. It focuses on how the runtime grows as the input size increases, rather than measuring the actual clock time in seconds, which can vary based on hardware.

In professional discourse, it is almost always paired with Big O notation (e.g., O(n^2)) to provide a theoretical upper bound on growth. It is distinct from space complexity, which refers to the memory requirements of an algorithm.