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，也不是,注意，上周我们在这儿,实现的算法中，反复地,迭代进行选择，选出最小的数,然后将其放在合适的位置。

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

s We are back over to E as a function of n, l, m and s, only we got there through this other torturous route.

我们回到将E作为函数n，l和，只要我们解决了这个烦人的路径。

麻省理工公开课 - 固态化学导论课程节选

I put it in n. So here's where I'm pushing back.

我把它赋值给n，我把它放回这里。

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

If they type in bogus characters, it's going to yell at them and make them retry, and eventually I'm going to get handed back an int, which I'm storing in n. Well, if I actually want to judge this number based on its magnitude, well, I can say now, "If n is greater than or equal to one."

如果他们键入了不合法的字符，它将对他们叫喊,然后叫他们重试，最终我将,得到一个int数，它是存储在n中的，好的，如果我的确想要根据它的量级来判定这个数字，好的，现在我可以指明，“是否n大于等于1“

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