-
At that stage we can merge these, and then take this down, do the division merge and bring them back up.
在那里做一次分解，做到这步时，我们可以把这些进行合并，然后把这个拿下来,做分解合并过程后再把它们拿回去。
-
I'm dividing it in half and half, and half and half, but each time I do that there's this merging process.
我将其划分为一半又一半，每次我还要做的就是合并的过程。
-
And the third thing I need to decide is how do I combine? You know, point out to you in the binary search case, combination was trivial. The answer to the final search was just the answer all the way up.
第三个问题是我需要决定如何进行合并？,就你们所知的，在二分查找中所打印出来的,合并的过程是非常简单的,最后查询的结果,就是一路上来所以的结果。
-
When I started merging, I did merging three times across this whole board, this level, this level, and this level, and each time because of the way I was advancing my fingers I touched each number just once.
在整个过程中，我一共做了,三次合并，这一层，这一层，和这一层，而且每次,由于要前移手指，因此对每个数字,仅仅移动了一次。
-
So things that are good candidates for divide And conquer are problems where it's easy to figure out how to divide down, and the combination is of little complexity.
因为适合用分治算法解决的问题,最好是能够简单的将问题进行分解,并且合并的过程不是非常的复杂,只要比线性方案要小。
-
If I'm basically just squeezing jello, that is, I'm trying to make the problem simpler, but the combination turns out to be really complex, I've not gained anything.
如果我只是简单的挤压果汁，那么我是在尝试着让问题变得简单，但是合并过程就真的比较复杂,我得不到任何东西。
-
I merge. And the merge is, put them in order.
合并的过程是将它们按顺序摆放。
-
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.
因此被称为分治的原因就这么简单,将一个问题分解成一些子问题,并希望这些子问题解决起来比较方便,正如你希望的，求解的过程也会变得简单,下面就是把结果合并起来,现在，在二分搜索的例子里,从某些方面来说，这有点微不足道。
-
Notice here that it's different than the binary search case. We're certainly dividing down, but the combination now actually takes some work. I'll have to actually figure out how to put them back together. And that's a general thing you want to keep in mind when you're thinking about designing a divide and conquer kind of algorithm.
一个分治的例子,注这里，与二分查找所不同的地方,我们肯定是分解了,但是合并的过程还是需要一些工作量的,我会详细说明怎样把它们合并在一起的,当你在考虑设计一个分治算法时,这是你要必须记住的最基本的东西。
-
But that merging process only takes N steps, N*log N so that's N times log of N. Now, it's a little tricky to reason through this perhaps the first time, let's just take a very simple example and see if we can do a little sanity check here.
但这个合并过程只需要N步，所以时间复杂度是,第一次对此进行推论可能会有点儿棘手，我们举一个简单的例子,看看我们能否做一些完整性的检查。
应用推荐