Ask Question
4 March, 23:32

Suppose the running time of an algorithm on inputs of size 1,000, 2,000, 3,000, and 4,000 is 5 seconds, 20 seconds, 45 seconds, and 80 seconds, respectively. estimate how long it will take to solve a problem of size 5,000. is the order of growth of the running time of the linear, linearithmic, quadratic, cubic, or exponential?

+2
Answers (1)
  1. 5 March, 01:17
    0
    The answer is B. 0.6 seconds, just took the test got 83% : D
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “Suppose the running time of an algorithm on inputs of size 1,000, 2,000, 3,000, and 4,000 is 5 seconds, 20 seconds, 45 seconds, and 80 ...” in 📘 Mathematics if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers