And so the fact that in this whole slide here, this algorithm for sorting, I'm using the verb sort.

在这个排序算法中,我用到了一个动词排序。

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

Just contrast this for a brief moment to something like Selection Sort which from the get go had a ridiculous amount of redundancy comparing the same damn numbers again and again, and again.

这就与其他的排序算法形成了鲜明的对比,比如选择排序,它会一次又一次地做,多余的比较。

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

They are computationally challenged, meaning, at the time they were invented, they were perfectly good sorting algorithms, there are better ones, we're going to see a much better one next time around, but this is a good way to just start thinking about how to do the algorithm, or how to do the sort.

他们是相当棒的排序算法，是有更好的算法，我们下一次,就会看一个更好的，但是开始想想,如何完成算法，或者说是如何排序,是一个好的学习方法,恩，再试试吧,如何来排序呢？

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

And we haven't seen all of these sorts, but it's actually quite neat to recognize how different the underlying work is of each of these algorithms.

我们还没有探讨所有的排序算法，但应该很容易区分,每一种算法其内在的,不同之处。

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

Well, you need an algorithm for sorting.

你需要一种排序算法。

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

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.

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

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