O'Reilly logo
  • You Wang thinks this is interesting:

In order to study an algorithm's performance, computer scientists ask how its performance changes as the size of the problem changes.

From

Cover of Essential Algorithms: A Practical Approach to Computer Algorithms

Note

so instead of using absolute running time, we use the character of growth to evaluate an algorithm's performance