So this isn't-- OK. And you're also close. It's going to be linear but how many times do I go through this?

每次能丢掉一半，所以这里不是-,好的，但你也很接近了,他可能是线性的，但我得遍历多少次呢？

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

So, every time I ride on the subway, it's kind of exciting for me.

所以，每次我坐地铁的时候，都很兴奋。

地铁的好处 - SpeakingMax英语口语达人

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次，找到最终的元素,我们来换个方向，对。

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

That's why you've got to be here every meeting and never coming late. All right?

所以你们每次都得来,而且不要迟到，好吗？

麻省理工公开课 - 电影哲学课程节选

And unlike n, l can start all the way down at 0, and it increases by integer value, so we go 1, 2, 3, and all the way up.

不像n，l可以从0开始取，然后每次增加一个整数，所以我们可以去1，2，3，一直下去。

麻省理工公开课 - 化学原理课程节选

So, for the most part any time we talk about or draw pointers an arrow suffices, which really 71 in there is a number like 71, which is the literal byte that the F is actually in in RAM, but frankly who cares?

所以，每次我们讨论,或者用箭头表示指针,在指针里面有一个数字，如,那是F在RAM中的字节，但是谁在乎它呢？

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

And so, if you rewind the tape and play it again over and over and over again, each time you set things up the very same way they must move or transform or change or end up in the very same state.

所以,如果你将一盘磁带,反反复复地播放,每次你播放的内容,从头到尾的起承转合一定是,绝对一致的

耶鲁公开课 - 死亡课程节选

so that's always something to look forward to when I go there.

所以我每次去都很盼着这个。

纽约很棒 - SpeakingMax英语口语达人

So before long, we'll see, especially for problems that we can't allocate an int every time we want to store something, because what if we want to store 140,000 English words.

所以不久后，我们将看到，特别是对于,我们不能为int分配内存，每次我们想要,存储一些东西时，因为当我们想要,存储140，000个英语单词时。

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

So, certainly the CS50 Library designed to be dynamic and, in fact, any time you call get string, we are, in fact, ; allocating a chunk of RAM but it's not coming from the stack; it's actually coming from this portion of memory called the heap.

所以，Cs50库是动态设计的，实际上，每次你调用GetSting时，我们分配一块内存，但它不是来自栈;,而是来自于叫做堆的,内存的一部分。

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

Every time I try to picture myself being dead, I smuggle myself back in, conscious and existing as a person, hence, not dead as a person.

每次我想象自己的死亡时，就会将自己带入，有意识作为人而存在的状态，所以也就不再处于死亡了。

耶鲁公开课 - 死亡课程节选

if you don't want to use that, you can also derive it as we did every time, it should intuitively make sense how we got there. But the exams are pretty short, so we don't want you doing that every time, so we'll save the 2 minutes and give you the equations directly, but it's still important to know how to use them.

吸收的和发射的，如果你不想用公式,你也可以每次都向我们这样推导它,很直观的就能得到结果，但考试时间很短，我们不希望你们每次都推导,所以我们会直告诉你，让你节省2分钟，但知道如何应用它十分重要。

麻省理工公开课 - 化学原理课程节选

Because I keep counting down each time around-- mostly I've got to unload this candy which is driving me nuts, so-- thank you.

因为我每次循环b减了,我一共要执行这个循环b次,所以这里我们一共执行了3b次基本操作。

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

And now we get the p orbitals, remember we want to fill up 1 orbital at a time before we double up, so we'll put one in the 2 p x, then one in the 2 p z, and then one in the 2 p y.

我们到了p轨道，记住在双倍填充之前,我们想要每次填充至一个轨道，所以我们在2px填充一个然后2pz填充一个，然后2py填充一个。

麻省理工公开课 - 化学原理课程节选