What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster than an algorithm whose running time is 2n on the same machine?

Answer

You should really do your own homework, however, another thoughtful person has provided a link in the related section that should give you some insight on how to solve this problem.

 

Improve Answer View existing comments for "What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster than an algorithm whose running time is 2n on the same machine?" Watch Question

First answer by ID996044873. Last edit by Speeddaimon. Contributor trust: 66 [recommend contributor]. Question popularity: 1 [recommend question]


Research your answer:

Can you answer other questions about science?

Answers.com > Wiki Answers > Categories > Science > What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster than an algorithm whose running time is 2n on the same machine?

Our contributors said this page should be displayed for the questions below. (Where do these come from)
If any of these are not a genuine rephrasing of the question, please help out and edit these alternates.
Algorithm running time?  Time complexity of an algorithm?  What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster than an algorithm whose running time is 2n on the same machine'?  What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster then the algorithm whose running time is 2n on the same machine?  1What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster than an algorithm whose running time is 2n on the same machine?  What is the smallest value of n such that an algorithem whose running time is 100n2 runs faster than an algorithm whose running time is 2n on the same machine?  What is the smallest value of n such that an algroithm whose running time is 100n2 runs faster than an algorithm whose running time is 2n on the same machine?  What is the samallest value of n such that an algorthim whose running time is 100n2 runs faster than an algorithm whoose running time is 2n on the same time?  What is the smallest value of n such thatan algorithm whose running time is 1002n runs faster than an algogithm whose running time is 2n on the same machine?  What is the smallest value of n such thatan algorithm whose running time is 100n2 runs faster than an algorithm whose running time is 2n on the same machine?  What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster?