- Assume that an algorithm consists of two parts, one part is 0(n^2) and the other in 0(n). What is the Big-0 run-time for the entire algorithm?

- The Paradox of Speed:

Suppose that computers become 16 times faster. If the same amount of computer time is to be used, how much can the data set size be increased if the underlying algorithm is:

a. 0(n) b. 0(n^2)

- Determine the answer and explain why it is the answer:

a. 0(n) + 0(n) = ? b. 0(n) + 0(n^2) = ? c. 0(log n) + 0(n) = ?