Students find that it is convenient to think of recursion in terms of composition of functions. They are explicitly aware of the order in which operations are done. For example, in Section 4.1, it is clear that the sum is accumulated in the order 0 + 1 + ...+ 5. They are also aware that recursive definitions may be used to provide efficient iterative programs as a result of analysis to determine whether or not a definition is tail recursive.