·2,447,543篇论文数据,部分数据来源于NoteExpress
所以,只想直接展开结构,可能会形成无限的递归循环。
As a result, just trying to expand the structure directly leads to infinite recursion loops.
最终结果是一个无限递归循环,Flash Player可能会挂起整个应用程序,甚至可能挂起用户的系统。
The end result is an infinite recursive loop, and Flash Player will hang, freezing the entire application and possibly the user's system, too.
实际上,可以认为循环和递归函数是能够相互转换的。
In fact, loops and recursive functions can be considered interchangeable.
We saw some quadratic algorithms, typically those are things with multiple nested loops, or iterative or recursive calls, where you're doing, say, a linear amount of time but you're doing it a linear number of times and so it becomes quadratic, and you'll see other polynomial kinds of algorithms.
我们看过一些平方算法,他们一般进行了多次嵌套循环,或者递归迭代调用,对一个线性操作调用线性次,这样就变成平方次了,以后你们能看到,一些多项式算法。
应用推荐