So in this case, we don't have enough energy to eject an electron, so, an electron is not ejected.

所以在这种情况下，我们没有足够的能量,去逐出一个电子，这样没有电子被逐出。

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

Let me give you, I'm going to create, q a polar point, I'm going to call it q, and we'll give it some random values.

让我给大家讲解下，我要去创建，一个极坐标点，然后我会去命名它为，然后我给它赋一些随机的值，好，现在我想知道。

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

Now on the next screen, once this thing resumes, realize that-- come on.

下面我们看下一个画面，注意啦，一旦启动，好好地去感受一下。

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

I've got to go to the first place, figure out how far over to skip, go to the next place, figure out how far over to skip, eventually I'll be out the door.

需要多长时间？,这太离谱了，因为我需要先去第一个元素,计算出下一个元素。

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

If it's there, I'm done. If not, I go there.

如果不相等的话，我继续去下一个元素比较。

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

I'll let you just grok it but you can see it's basically doing what I did over there. Setting up two indices for the two sub-list,it's just walking down, finding the smallest element, putting it into a new list. When it gets to the end of one of the lists, it skips to the next part, and only one of these two pieces will get called because only one of them is going to have things leftovers.

你们可以大体的浏览一下,但是它们基本就是我在那里所做的事情,为两个子列表设置了两个指针,指针顺着列表走下去，找到最小的元素,把它放入到一个新的列表中去,当它走到一个列表的尾部时,它会跳到下部分去,两部分中只有一个会被执行,因为只有一个会有元素剩余。

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