+**Time complexity** is a measure of the computational resources, specifically time, an [algorithm](/wiki/algorithm) requires to run as its input size grows. It quantifies how execution time scales, often expressed using [Big O notation](/wiki/big_o_notation) to describe its asymptotic behavior, and is crucial for evaluating an algorithm's efficiency.
+## See also
+- [Space complexity](/wiki/space_complexity)
+- [Data structure](/wiki/data_structure)
+- [Computational complexity](/wiki/computational_complexity)