At that stage we can merge these, and then take this down, do the division merge and bring them back up.

在那里做一次分解，做到这步时，我们可以把这些进行合并，然后把这个拿下来,做分解合并过程后再把它们拿回去。

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

The writer wants to represent God going down there, and he will bring them back.

作家想要展示上帝下埃及去，他也会将他们带回来。

耶鲁公开课 - 旧约导论课程节选

The women of Paris in October, many of them will walk to versailles to bring the king back to Paris.

在10月份的时候,许多巴黎的妇女会步行去凡尔赛迎驾

耶鲁公开课 - 欧洲文明课程节选

So to just preface what we're going to do next time, what would happen if I wanted to do sort, and rather than in sorting the entire list at once, I broke it into pieces, and sorted the pieces, and then just figured out a very efficient way to bring those two pieces and merge them back together again?

所以为了引导下一次,我们要讲的内容,如果我想做排序,而且不是一次吧整个列表排完,会发生什么，我把它拆成小的列表,然后把各个小列表排序,接着用高效的方法再把小的列表？

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