Go backward to Go up to Top Go forward to Big O Quantor

Motivation

• Detailed execution time of an algorithm for input size n.

  7n²+3n+19

• "Essential" growth of the execution time with increasing n.

  n²

• Constant factors and smaller sums ignored.

Capture the "essential" growth of a function.