Question

Difference between polynomial vs exponential running time

Answer 1

Answer:

Algorithms which have exponential timecomplexity grow much faster thanpolynomial algorithms. The difference you are probably looking for happens to be where the variable is in the equation that expresses the run time. Equations that show apolynomial time complexity have variables in the bases of their terms.

hope it helps u..

please mark me as a brainliest..

Answer 2

Some points mentioned below stating the difference between polynomial vs exponential running time :

• Usually the exponential complexity takes more time and space than the polynomial complexity for same number of the variables.

• Polynomial complexity increases polynomially when number of variables are increased and it takes more time but can accept high amount of variables than exponential.