Time Complexity Formula
The computational complexity that describes the amount of time it takes to run an algorithm.
Formula
T(n) = O(f(n))
Discipline: Computer Science. Result unit: dimensionless.
Variables and units
- T(n) — Time Complexity: Time as a function of input size
- f(n) — Big O Function: Function describing growth rate