"The field commander has said 'I need a lot more troops.' And I think it's more than most people, at least in their calculus in the back of their minds, imprecise as that probably was, it was a larger number than they were prepared for,".

VOA: standard.2009.10.16

And then hash character takes in any string or character, single character, gives me back a number. Notice what I do.

然后哈希接受任何字符串或字母，单个字符,返回给我一个数字，注意我要做什么。

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

So if you had some number back in grade school like 123, well, why do we express this as 123?

在小学，像123这样的数，为什么我们要表达成123这样的呢？

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

So I think it is important to keep this in mind and I'm gonna be coming back to this a number of times as we talk about the experiments we were doing at the Soen School of management.

你们要牢记这一点,因为之后,我们会谈到这个问题,做的实验时,我会反复提到这个内容。

麻省理工公开课 - 媒体、教育、市场课程节选

So in this case, it just keeps chopping down from the back end, which kind of makes sense, all right? But in a fixed number, in fact, twenty-three calls, it gets down to the point of being able to say whether it's there.

所以在这个例子中,我们能理解他从后端开始排除元素，这，里事实上每次会确定的运行23次，找到最终的元素,我们来换个方向，对。

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

We export food but we also export norms, we export economics of food, and a number of things that affect the world, and that comes back to affect us.

我们出口食品的同时还出口标准,我们出口的是食品经济,以及一系列对世界产生影响的东西,它们会反过来影响我们

耶鲁公开课 - 关于食物的心理学、生物学和政治学课程节选

As we all know, this only works if there is a pointee, which kind of gets back to rule number one.

众所周知，只有当有指针数据时，这个才起作用，这有点像第一条规则。

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

That's the finger thing from left finger to right finger going back and forth across the board, never touching a number more than once.

在合并时，我的左手手指,和右手手指来回地在黑板上移动，但对每个数字只会碰到一次。

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

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

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

I don't happen to like this, but he thinks that is, give a combination of a number multiplication in a string, this will in fact give us back a new string with that many replicas, if you like, of the string concatenated together.

我不喜欢这么做但是他认为,也就是说，返回一个字符串的,某个特定数字的倍数，这实际上会返回一个新字符串,一个原来的字符串的很多复制品，连接到一块的一个字符串。

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

In either case, I take that value and multiply back by two, if it was even I get back the original number, if it was odd, I'm not going to get back the original number, so I can just check to see if they're the same.

在两种情况中，我都把结果值,再乘以2，如果x是偶数我就,得到了原来的值，如果x是奇数那么就不会得到,原来的值，因此我看看得到的值,和原来的值相等不相等就可以了。

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

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“

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