Algorithmic Time Complexity
Natural & Formal Sciences Dictionary
Definition
A characterization of the growth rate of an algorithm's running time as a function of input size, typically expressed asymptotically (e.g., Big O) to compare scalability.