BIG- O Notation problem
Why is Big-O notation called asymptotic?
a.
It is valid only for algorithms whose operation count looks likea hyperbola.
b.
It estimates the amount of work an
algorithm has to do as the number of items
to process approaches infinity.
c.
It estimates the work of an algorithm in terms of apolynomial.
d.
It provides an approximate way to compare the work of twoalgorithms.
Expert Answer
An answer will be send to you shortly. . . . .