"Looking at the 23 million people in sub-Saharan Africa who are infected, Ethiopia estimates are, makes up about one million of those,"

VOA: standard.2009.11.15

Having done that, it goes back up and picks the second sub-list, which came from there. It's a down to base case, merges it.

就是从那里得来的,完成这些后,回到上一步。

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

If you want to have an infinitestimally small change, you end up writing dh is dq sub p.

这是对于有限的变化而言的,如果是一个无限小的变化。

麻省理工公开课 - 热力学与动力学课程节选

And it's called divide and conquer for the obvious reason. I'm going to divide it up into sub-problems with the hope that those sub-problems get easier. It's going to be easier to conquer if you like, and then I'm going to merge them back. Now, in the binary search case, in some sense, this is a little bit trivial.

因此被称为分治的原因就这么简单,将一个问题分解成一些子问题,并希望这些子问题解决起来比较方便,正如你希望的，求解的过程也会变得简单,下面就是把结果合并起来,现在，在二分搜索的例子里,从某些方面来说，这有点微不足道。

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

So the allowed values for m sub l 0 are going to be negative l, all the way up to 0, l and then up to positive l.

所以m小标l的可能值,是从负l，一直到，然后到正。

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

I'll let you just grok it but you can see it's basically doing what I did over there. Setting up two indices for the two sub-list,it's just walking down, finding the smallest element, putting it into a new list. When it gets to the end of one of the lists, it skips to the next part, and only one of these two pieces will get called because only one of them is going to have things leftovers.

你们可以大体的浏览一下,但是它们基本就是我在那里所做的事情,为两个子列表设置了两个指针,指针顺着列表走下去，找到最小的元素,把它放入到一个新的列表中去,当它走到一个列表的尾部时,它会跳到下部分去,两部分中只有一个会被执行,因为只有一个会有元素剩余。

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