adplus-dvertising
frame-decoration

Question

An algorithm with running-time of a highest-order term containing a factor of n^2 is said to have a

a.

Quadratic growth rate

b.

Exponential growth rate

c.

Absolute growth rate

d.

Linear growth rate

Answer: (a).Quadratic growth rate

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. An algorithm with running-time of a highest-order term containing a factor of n^2 is said to have a