Polynomial time and exponential time

Question

Could someone explain the difference between polynomial-time, non-polynomial-time, and exponential-time algorithms?

For example, if an algorithm takes O(n^2) time, t

Answer 1

Exponential (You have an exponential function if MINIMAL ONE EXPONENT is dependent on a parameter):

• E.g. f(x) = constant ^ x

Polynomial (You have a polynomial function if NO EXPONENT is dependent on some function parameters):

• E.g. f(x) = x ^ constant