I first tested it on the square root of 4 and in one iteration it found 2.

我首先测了下求4的平方根4,它只迭代了一次并返回了2。

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

So what have I done? We've now generalized the idea of iteration into this little pattern.

我们刚刚学到了什么？,我们现在已经在这小小的模式中。

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

N But it's definitely not one and in fact it wasn't N in the case of Selection Sort because remember the algorithm we implemented on stage last week had me going back and forth across the stage selecting on iteration, the smallest person I can find, the smallest number and then putting them into place.

但在选择排序中，肯定不会是1，也不是,注意，上周我们在这儿,实现的算法中，反复地,迭代进行选择，选出最小的数,然后将其放在合适的位置。

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

Which is iteration. Or loops.

也就是迭代，或者循环。

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

> So now that might not have felt like the fastest algorithm but think about what you could have done with that algorithm in each iteration, much like the phonebook up front here, you literally split that problem in two because on each iteration roughly half of you were sitting down and then another half and then another half.

虽然这并不是最快的算法,但如果把这种算法每次迭代,就像刚才查电话簿一样，你便将这个问题一分为二了,因为每一次迭代后只有一半坐下来,以此类推。

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

And I'll remind you, what I'm printing out there is first and last, with the range I'm looking over, and then just how many times the iteration called.

我要打印出来的是，每次的区间,也就是first和last指向的值，以及重复多少次了。

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