**Questions:**

- What is significant about the largest term in an algorithm's efficiency
formula? [Answer]

- What is order notation? [Answer]

- Rank the following list of efficiency formulas from most efficient
to least efficient:
*n*^{2}, *n*, 2^{n},
log *n*, *n*^{3}, 10^{n}. (Hint:
if you are unsure of the order, test each formula with several large
values of *n*.) [Answer]

- For the following four efficiency formulas, calculate the number of
operations performed for
*n* = 100, *n* = 1,000, and *n* = 10,000. [Answer]

*n*^{2}
*n*^{2} - n + 5
*n*^{2} + 4n - 12
*n*^{2} - 3n - 7

- Notice that formulas for parts b, c, and d in question 5 include extra
terms that are not squared. For each value of
*n*, find the number
of operations that these terms contribute the total. Note that some
of these values may be negative. [Answer]

- Using the answers from question 5, find the percentage of operations
that the non-squared terms contribute for each value of
*n*. Round
your answers to two decimal places. In general, what conclusion can
you make about the contribution of the non-squared terms to the total
number of operations? [Answer]

- Do the concepts of efficiency and order notation only apply to sorting
algorithms? [Answer]