10.3 Continuous (continuations)

10.3 Continuous (continuations)

From the beginning of this chapter, we discuss recursive invocation. We have seen the tail recursion (tail recursion), which is an important technique for recursive invocation and does not need to allocate any space on the stack. Because of the tail recursion, the Function list processing function written out can handle large datasets without sweating.

We have used tail recursion to rewrite a number of functions, taking advantage of the accumulator parameters, but not every function can rewrite this. If a function needs to perform two recursive calls, it is clearly not possible to do so. (after all, they cannot all be executed before they are returned.) ）

10.3 Continuous (continuations)