And then the things I have to ask is how much of a division do I want to do?

如果可以这么做，那么分治算法是个好的选择,接下的问题就是我需要把问题分成多少份？

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

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.

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

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

So what we want to do, is, I guess another way of saying it is, efficiency is really about choice of algorithm.

因此我们想做的就是，换种说法，效率实际上是算法的选择，我们想要培养你们。

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

One of the things you should begin to do, is to recognize what identifies those classes of algorithms, so you can map your problems into those ranges.

你们现在开始要做的事情之一，就是要学会辨别这些算法,这样你就能为你的问题，选择对应种类的算法了。

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

N But it's definitely not one and in fact it wasn't N in the case of Selection Sort because remember the algorithm we implemented on stage last week had me going back and forth across the stage selecting on iteration, the smallest person I can find, the smallest number and then putting them into place.

但在选择排序中，肯定不会是1，也不是,注意，上周我们在这儿,实现的算法中，反复地,迭代进行选择，选出最小的数,然后将其放在合适的位置。

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

So he's packing and unpacking, packing and unpacking, trying all possible combinations of objects that will obey the constraint. And then choosing the winner. Well, this is like an algorithm we've seen before. It's not greedy.

因此它不断装包和清包,尝试了所有满足约束条件的物品组合,最后选择最优者,这很像我们以前看过的一个算法,这不是贪婪算法。

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

Blah, try again. How to do this sort.

首先我想说的是被称作选择排序的算法。

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

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

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