1. What is the difference between the growth function of an algorithm and the order of that algorithm?
2. Why does speeding up the CPU not necessarily speed up the process by the same amount?
3. How do we use the growth function of an algorithm to determine its order?
4. How do we determine the time complexity of a loop?
5. How do we determine the time complexity of a method call?