I have algorithms with the ﬁve running times listed below. (Assume these are the exact running times.) How much slower do each of these algorithms get when I(i) double the input size, or (ii) increase the input size by one?

a)n^2

b)n^3

c)100n^2

d)nlogn

e)2^n

a)n^2

b)n^3

c)100n^2

d)nlogn

e)2^n

This sounds suspiciously like a test or quiz question. We have a policy not to do people's homework for them. I don't think we want to get in the habit of taking people's tests for them, either.

If you can do high school math (understanding exponents and logarithms), this is a fairly straight forward question.

If you can do high school math (understanding exponents and logarithms), this is a fairly straight forward question.

Thank you doug4. I am studying exponents right now.And I finished first,second and third questions.

Topic archived. No new replies allowed.