And this is in contrast to Selection Sort where you're fishing again and again for the then smallest element.

这与选择排序是相反的,在选择排序中你需要一次又一次地,找出最小的元素。

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

And that you might look at, for example, that first example, and say, man by this stage it was already sorted, yet it had to go through and check that the third element was in the right place, and then the fourth and then the fifth and then the six.

你可能会去看看例如第一个例子，然后要抱怨，到这里,它已经是排好序的了,但他还是得去遍历查看,第三个元素是不是在正确的位置,然后第四个，第五个，第六个。

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

All of this suggests then that the unpredictability of our death adds an extra negative element.

这一切表明,死亡的不可预见性,添加了额外的负面因素。

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

s1 So for the fourth period, now we're into the 4 s 1 3d for potassium here. And what we notice when we get to the third element in 4s2 and the fourth period is 3d that we go 4 s 2 and then we're back to the 3 d's.

对于第四周期到现在我们来到钾的1,然后我们返回到,我们注意到当我们看到第三个元素,第四周期我们来到,然后我们返回到。

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

So the first one here is something called insertion sort which amounts to going through the list, taking the first thing that you see and inserting that element into its correct place, - then moving on to the next one, dealing with what element-- whatever element you're given and putting it in its right place.

首先是插入排序,在此算法中，需要遍历整个列表,将你遇到的第一个元素放在其正确的位置，然后移动到下一个元素，继续处理-,不管是什么元素,都将其插入到合适的位置。

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

And then the element and maybe the table.

这种圆点标记法就是为了避免混淆歧义。

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

Just swapping them, right? I temporarily hold on to what's in the i'th element so I can move the i plus first one in, and then replace that with the i'th element.

交换他们，对么？,临时的保存下第i个元素,然后把第i+1个元素移进来，把i+1的位置替换为第i个元素。

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

So we want to look at any element that has a 3 p orbital filled, but that does not then go on and have a 4 s, because if it had the 4 s filled then we would actually see six lines in the spectrum.

所以，我们要找一找有哪些元素的,3，p，轨道被占据，但没有，4，s，轨道被占据,因为如果，4，s，轨道也被占据了,那我们会在光谱中看到第六条谱线。

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

With this, if I can assume that accessing the i'th element of a list is constant, then you can't see that the rest of that analysis looks just like the log analysis I did before, and each step, no matter which branch I'm taking, I'm cutting the problem down in half.

读取数组中的第i个元素,是个常量时间的操作的话，我也就能像以前那样得到,这个算法是对数级复杂度的分析,并且每一步不管我选择哪个区间，我都可以把问题的规模缩小一半。

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