She is sorting through masses of dried green moss.

VOA: standard.2009.12.30

So I've done sorting of the left half.

已对左边排序。

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

It's sorting things based on the light frequencies, but it doesn't have the experience of seeing red.

它只是根据光频来分辨颜色而已,并没有看见红色的体验

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

He says the process of sorting through those areas, which include sites around the country,but concentrated in the mountainous northern areas, will be a long and difficult one, though it is work that needs to be done in the name of the victims' families.

VOA: standard.2009.12.18

Selection sort too really reduces to a total number of comparisons because I'm again comparing the current smallest to the next thing I see, the next thing, so really a lot of these sorting algorithms boil down to comparisons and the numbers that you actually have to make.

选择排序也可归纳为总数的比较,因为要将当前最小者与下一个进行比较,接着再下一个，可见,很多排序算法都可归结为比较,以及需要比较的次数。

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

OK. What's this thing doing then, in terms of sorting?

这是在做什么呢？排序么？,在第一遍结束的时候？

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

And the context of sorting, the worst case is your handed a problem that's in complete reverse order because that implies you have - to do as more work that could possibly-- that you could-- you have to do more work than you would of course if things were in perfect order.

在排序的环境中，最糟糕的情况是待排序的序列是,完全逆序的，在这种情况下,你不得不做更多的工作-,比起一个较理想顺序的序列,你必须花费更多的努力。

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

OK. Having said that, let's look at doing some sorts. And I'm going to start with a couple of dumb sorting mechanisms. Actually, that's the wrong way saying it, they're simply brain-damaged, they're not dumb, OK?

我们来做些排序吧,我要开始处理一些愚蠢的排序机制,事实上，我说的不正确，他们就是没脑子，不是笨,发明出来后，他们就在不停的被挑战？

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

OK. Could we do better in terms of sorting?

我们在排序上可能做的更好么？

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

I'm done sorting a list of size 2.

现在我已将这2杯排好序了。

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

So supposed that I give you 16 elements to sort, well, following the logic before, the running time involved in sorting 16 elements is gonna be twice the running time 16 of sorting 8 elements, left half and right half plus 16 - and again, a little sanity check, 16 means-- just the merge steps, right?

现在要对16个元素进行排序，根据之前的逻辑，对16个元素排序,要花的时间是对8个元素排序所花时间的,2倍，分别用于左半部分和右半部分，再加上6,这里16是-,做合并的步数，对吗？

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

So I propose this as a new algorithm for sorting N elements and being 8 in this case or really a thousand in the case of the phonebook, or anything of larger size.

所以我提出一种新的算法，来解决N个元素的排序问题,在这个问题中N是8，在电话簿的问题中N是一千,或者是大规模的任何问题。

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

If I'm using algorithm that I'm now calling merge sort, T the running time involved in sorting N elements, T of N, you know, is just the same as running the algorithm for the right half, plus what's this plus N come from?

如果我用归并排序算法，对N个元素其运行时间，就等于此算法一半元素的运行时间,另一半的运行时间，再加上N，这个N是什么呢？

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