Asymptotic notation

TA(n) = c1 . n2 + c2 . n
TB(n) = c3 . n
TC(n) = 4. n2 + 10 . n
TD(n) = 6 . n2

• We consider Algorithm B to be better than Algorithms A, C and D.

• Formalized in “Big Oh” notation:

Previous slide

Next slide

Back to first slide

View graphic version