递归方法,是降格策略反映到数学思维中的一种方法,指从初始条件出发,利用递推关系而求得一般结果的方法,例如降维法。
递归方法也需要显式的返回类型。
例如,考虑在一个递归方法中会发生的事情。
Consider what would happen with a recursive method, for instance.
第二段是真正遍历文档表示和执行修改的递归方法。
The second fragment is a recursive method to actually walk through the document representation and perform the modifications.
This is actually a piece of code that is really easy to think about recursively and is much more difficult to think about in other ways.
这确实是一段用递归思考起来非常容易,而其它方法特别麻烦的代码,这一段代码的意思就是。
This is another way of doing exponentiation, but this one's a recursive function. All right?
但这是一种递归的方法对不对?,好,让我们看看这种方法?
So now, let's recurse together, let's dive in and hone in on what T of 8 is.
下面用递归的方法继续,看看T是多少。
应用推荐