What this did is it allowed banks to offer insurance or to ally and join in and merge with insurance companies.

这个法案允许了银行从事保险业务,或者与保险公司合作,整合,并购

耶鲁公开课 - 金融市场课程节选

When these two merges are done, we're basically at a stage in that branch where we can now merge those two together, which gives us that, and it goes through the rest of it.

拿到从那边得到的第二个子列表，这是一个基本情况,合并它，当这两个合并完成后，我们基本到了该分支阶段，这里我们可以把两个合并在一起。

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

It at least does corroborate the claim that merge sort N*log N as we argue intuitively is in fact, N log N in running time.

但这至少证实了归并排序,的时间复杂度为。

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

Yeats was trained in the occult disciplines of Theosophy and Gnosticism. Those traditions merge in his early work with European symbolism, and also with Irish cultural nationalism.

叶芝曾受到通神论和诺斯替教,神秘主义教条的训练，这些传统,在他早期作品中与欧洲象征主义，和爱尔兰文化民族主义结合。

耶鲁公开课 - 现代诗歌课程节选

Well, we saw the teaser in terms of that animation that suggests this merge sort algorithm when implemented by a computer is absolutely faster.

我们从前面的动画中可以看到,这个归并排序算法在计算机上实现之后,绝对比其他算法更快。

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

Sure. So that says one should be the first element in my merge list.

所以可以确定1应该是合并后的,列表的第一个元素。

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

So in other words, every time I merge the point that I kept emphasizing verbally there and that I'm only touching each number once, means that we have to account for the amount of time it takes to merge N which is going to be just N. Now, this is again one of these cyclical answers.

换言之，之前在做合并时,我不停地强调,对每个数字我只碰了一次，这就是说,我们要记录合并所花的时间量,也就是这里的,这又是一种循环性的答案。

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

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.

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

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

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是什么呢？

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