Problem
1. Suppose it is known that the running time of one algorithm is always about N logN and that the running time of another algorithm is always about N3. What does this say about the relative performance of the algorithms?
2. Explain the difference between 0(1) and 0(2).