Some algorithms are recursivein nature, trying to write non-recursive algorithms is tedious, and in the end they become recursive simulations that use stacks themselves!
有些算法本质上是递归的,为之编写非递归算法会非常冗长,而且最终也必须使用堆栈进行递归模拟。
2
So how does this tie back in to recursive composition?
那么如何将其绑回到递归组合中呢?
3
Many plants follow simple recursive formulas in generating their branching shapes and leaf patterns.