Directions: Answer each of the following questions. Please ensure that your responses are at least 3 to 5 sentences in length.
1. What measurements indicate a program's efficiency?
2. The analysis of algorithms-as an area of study-provides what tools for the computer scientist?
3. List three reasons why you should not write and run C++ programs to compare the time efficiency of algorithms.
4. What does an algorithm's growth rate measure?
5. What is a growth-rate function?
6. What is measured by a worst-case analysis?
7. What is measured by an average-case analysis?
8. When choosing between two algorithms, under what conditions can the efficiencies of the algorithms be ignored?