Moment 4, asymptotisk klassificering

Mål

Att du kan använda stora O notationen och förstå dess syfte, innebörd och begränsningar.

Egna anteckningar.

I litteraturen: Kapitel Principles of Algorithm analysis

Ur Wikipedia:

Informally, especially in computer science, the Big O notation often is permitted to be somewhat abused to describe an asymptotic tight bound where using Big Theta Θ notation might be more factually appropriate in a given context. For example, when considering a function T(n) = 73n³ + 22n² + 58, all of the following are generally acceptable, but tightnesses of bound (i.e., bullets 2 and 3 below) are usually strongly preferred over laxness of bound (i.e., bullet 1 below).