In the second case, I found in the next smallest element and moved here, taking what was there and moving it on, in this case I would swap the 4 and the 8, and in next case I wouldn't have to do anything.

在第二次遍历中，我找到了,第二小的元素，把它移到这里,把这里原来的元素移到哪里,在这一次遍历中，我会把8和4交换,然后一次遍历，不会做任何事情。

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

The easy thing to do would be the following: start at the front end of the list, check the first element. If it's the thing I'm looking for, I'm done. It's there. If not, move on to the next element. And keep doing that.

从数组的第一个元素开始：,如果这是目标元素那么结束,如果不是的话就继续比较下面的元素，并一直这么比较下去,但如果，在某一点我发现我要寻找的数字。

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

And I think you could win, if you're going on the Hustings, let me add one element to the argument you might make.

我认为，如果你参选，应该可以赢，我给你补充一点，你也许能用上。

耶鲁公开课 - 公正课程节选

Justice on the other hand,is an element of the polis.

另一方面,公正,也是城邦的一种元素

耶鲁公开课 - 古希腊历史简介课程节选

But days three and six each have an extra element, And the fact that the first elements here pair up nicely with each other suggests that the extra element on day three and the extra element on day six might also be paired in some important way.

但是第三天和第六天都有一个附加的因素，首要的因素就是这些事物都完美地匹配,这表明，第三天的附加因素,也应该与第六天的附加因素在重要的方面相匹配。

耶鲁公开课 - 旧约导论课程节选

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.

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

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

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个元素。

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