chapter5数据结构课件.pptVIP

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Data Structure Software College Northeast University The Cost of Recursion That data shows that recursion without optimization is more expensive than iteration by about a factor of four. With the highest level of optimization, though, recursion has exactly the same cost as iteration. The clever compilers noticed that the recursion is always the final call in the function (usually called tail recursion), and transformed it to iteration. Data Structure Software College Northeast University The Cost of Recursion When we first implemented the recursive length function, we used Cs ?: conditional expression to yield more succinct (but not necessarily clearer) code; see Example 2 (c). Data Structure Software College Northeast University The Cost of Recursion Example 2(c) int rcstrcmp(char *s, char *t) { return (*s == *t) ? (*s ? rcstrcmp(s+1, t+1) : 0) : *s - *t; } Data Structure Software College Northeast University The Cost of Recursion Exercise 2. Will using a conditional expression change the run time of the program? We had assumed the answer was no. The result shows that the times are similar. Data Structure Software College Northeast University Recursion or Iteration? EFFICIENCY CLARITY Data Structure Software College Northeast University Recursion or Iteration? The complex problems associated with the implementation of recursive routines like Fib can be left to language design and compiler writing. What is not to be left to them is: How can recursion be used as a design tool? When should it be used as a program design? Data Structure Software College Northeast University Recursion or Iteration? There is no definite answer to these questions, but--as a rule of thumb--if recursion is a natural expression of a problem solution and execution-time is not crucial, then use it. Data Structure Software College Northeast University /~zona/mmts/geometrySection/f