# If we switch from one computer to another that is 100 times as fast, what is our gain in problem size per hour in the use of an algorithm that is O(m), O(m 2 ), O(m 5 ), O(e m )?

Chapter 23, PROBLEM SET 23.2 #20

If we switch from one computer to another that is 100 times as fast, what is our gain in problem size per hour in the use of an algorithm that is O(m), O(m^{2}), O(m^{5}), O(e^{m})?

## This problem has been solved!

Do you need an answer to a question different from the above? Ask your question!

**Related Book For**

PROBLEM SET 23.2:

PROBLEM SET 23.4:

PROBLEM SET 23.5:

PROBLEM SET 23.6:

PROBLEM SET 23.7:

PROBLEM SET 23.8: