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

notion of running time complexity (as described in the next section) is based on knowing how big a problem instance is, and that size is simply the amount of memory needed to encode it

From

Cover of Python Algorithms: Mastering Basic Algorithms in the Python Language, Second Edition

Note

time complexity -> count of operations; space complexity -> size of memory used