And along the way I'm keeping track of how many iterations at the end I'll print how many iterations I took, before I return the final guess.

提到的方法去运行,并且我会跟踪到底,进行了多少次迭代,并在最后返回结果之前，显示进行了多少次迭代。

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

If I want a copy of the string, I've got to whip out my week 1 skills of just iterating with a four loop from left to right and make copies of those characters.

我需要那个字符串的一个拷贝，我使用,第一周的技巧，从左到右做四次迭代,然后复制这4个字符。

哈佛公开课 - 计算机科学课程节选

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.

我们看过一些平方算法，他们一般进行了多次嵌套循环,或者递归迭代调用，对一个线性操作调用线性次,这样就变成平方次了,以后你们能看到,一些多项式算法。

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

So if on each iteration of merging I'm doing eight things or more generally, N. That then begs the question, how many levels of this tree are there actually?

可见对于合并我需要迭代8次,一般情况下是N，这取决于具体问题，那么在这棵树中一共有多少层呢？

哈佛公开课 - 计算机科学课程节选

And in this case, we go from 8 to 4 to 2 to 1 three times and then on each iteration of this algorithm, each pass across the board I'm touching N numbers, so that means I'm doing N things, log N times.

在这个例子中，我们从8得到4，到2，再到1，是3次,在这个算法的每次迭代中，每一趟我都会操作N个数，也就是所我每次要做N步操作，一共要做，log，N，次。

哈佛公开课 - 计算机科学课程节选