🧮Time Complexity
Also known as Running Time, Runtime Complexity
How much more work as the input grows. It is written in Big O.
Think of it like
Think of it like a walk. You count the steps, not the minutes.
Example
Why it matters
It tells you whether code that runs fine on 100 rows will still run on 10 million.
Definition
Common mistake
Key takeaways
- 1Steps, not seconds. The machine does not matter.
- 2Written in Big O. O(1), O(n), O(n log n).
- 3Grows with input. That is the point.