我为什么不仅仅跟踪算法的,每一遍来看看我做了哪些交换呢？

Why don't I just keep track on each pass through the algorithm whether I have done any swaps?

youdao

此算法只扫描一遍数据库，并且二进制数的位运算速度比候选集与事务记录的比较运算速度要快得多。

This algorithm scans the data base only once and the speed of binary operation is faster than the speed of comparison of item sets and transactions.

youdao

可见，递归算法中新奇的一点是，为了实现一个想法，你可以一遍又一遍地做相同的事情，但每次的规模都会有所减小。

So, the curious thing about recursion is that pretty much always can you implement this idea of doing the same thing again and again and again but with smaller bytes each time.

youdao

Why don't I just keep track on each pass through the algorithm whether I have done any swaps?

我为什么不仅仅跟踪算法的,每一遍来看看我做了哪些交换呢？

麻省理工公开课 - 计算机科学及编程导论课程节选

I'm walking down the list.

算法遍历了一遍数组。

麻省理工公开课 - 计算机科学及编程导论课程节选