Time complexity describes how an algorithm's running time changes as a function of the input size. We count the number of elementary operations rather than seconds, which makes the measure independent of the machine. It is used to compare algorithms and predict their behavior on large data.
Example
Searching for a value in an unsorted list of n elements takes up to n comparisons.