An algorithm takes . 5ms for input size N = 100. How long will it take for input

Question

An algorithm takes . 5ms for input size N = 100. How long will it take for input size 500 if the running time is the following (assume no low-order terms) linear O(NlgN) (use log base 2 in your calculations) quadratic cubic An algorithm takes . 5ms for input size N = 100. How large a problem can be solved in one minute if the running time is the following (assume no low-order terms). linear O(NlgN) (use log base 2 in your calculations) quadratic cubic Extra Credit. True or false: For any positive constant c, f(cn) O(f(n))? Justify your answer.

Explanation / Answer

this might help u http://wiki.answers.com/Q/How_do_you_calculate_running_time_of_algorithm

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

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