 ##  [Algorithmic Time Complexity](/algorithmic-time-complexity) 

  ##  [Algorithmic Time Complexity](https://natural.quantumdictionary.io/algorithmic-time-complexity-0) 

  
 [![Natural & Formal Sciences Dictionary](/sites/default/files/styles/large/public/2026-01/Natural%20%26%20Formal%20Sciences.png.webp?itok=2kCDRVQv)](/topic-specific-dictionaries/natural-formal-sciences)


**Natural &amp; 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.