Need some help with below...I understand the 4 big-O orders but don\'t know the

Question

Need some help with below...I understand the 4 big-O orders but don't know the method of figuring things out...

1) An algorithm takes 0.5 ms for input size 100. How long will it take for input size 500. (assuming that low order terms are negligible) if the running time is:
- linear
- O(N log N)
- quadratic
- cubic

2) An algorithm takes 0.5 ms for input size 100. How large a problem can be solved in 1 minute (assuming that low order terms are negligible) if the running time is:
- linear
- O(N log N)
- quadratic
- cubic

Explanation / Answer

a.linear=2.5ms b.1.25ms c.6.25ms d.12.25ms

Related Questions

Navigate

• Browse (All)
• Browse N
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.