Asymptotic notation
TA(n) = c1 . n2 + c2 . n
TB(n) = c3 . n
For large n, Alg B is superior to Alg A, regardless of the value of c1, c2, c3.
I.e.
? no: ? n ? no : TA(n) ? TB(n)
Previous slide
Next slide
Back to first slide
View graphic version