This traversal is interesting because it is iterative, not recursive, which is a key difference between zipper traversal and the prior clojure.walk implementation.
这种遍历非常有趣，因为它是迭代的，而不是递归的，这是zippers 遍历与之前的 clojure.walk 实现之间的主要差别。
Once you hear that description, it's easy to write the code, in fact. This is a place where the recursive version of it is much easier to think about than the iterative one.
实际上一旦你听到了大致描述，就能很轻松的写出代码来，在这一点上应用递归来解决问题，比用迭代要容易理解多了。
Chapter 5 deals with partitioning problems, converting recursive functions to iterative functions (it's fun, I assure you), and more factorial and Fibonacci series implementations.
第 5章介绍了划分问题、递归函数到迭代函数的转换（我可以向您保证，这非常有趣）以及阶乘和斐波纳级数的实现。
This paper presents a recursive parameter identification algorithm for the system. Compared with the iterative algorithm, it can avoid the matrix inversion and can be operated on-line.
本文给出这类系统的参数递推辨识算法，克服了迭代算法不能在线运行、需反复矩阵求逆的不足。
This paper presents a recursive parameter identification algorithm for the system. Compared with the iterative algorithm, it can avoid the matrix inversion and can be operated on-line.
本文给出这类系统的参数递推辨识算法，克服了迭代算法不能在线运行、需反复矩阵求逆的不足。
应用推荐