Algorithms · Level 2 of 5
Time Complexity
How computational work scales with input size under an analysis model.
It describes growth rather than exact elapsed seconds.
Example
A pairwise comparison routine performs quadratically many checks.
Listen to the definition and example
Audio transcript
Time Complexity. How computational work scales with input size under an analysis model. It describes growth rather than exact elapsed seconds. For example: A pairwise comparison routine performs quadratically many checks.
Explore this concept
Why it matters
This helps you compare problem-solving methods and their computational tradeoffs.
Start with
Related concepts
Quick recall question
Try answering before looking back at the definition.