合并起来，而那些小列表，我又会把他们拆成更小的列表，再排序，这会给我，一个更高效的算法么？

Where those pieces, I would do the same thing with, I would divide them up into smaller chunks, and sort those. Is that going to give me a more efficient algorithm?

youdao

然后再根据重要性对写下来的列表进行排序。

Then I sorted them by order of importance. In writing.

youdao

例如，为了重新排序消息 2 下已存在的消息 1，您就不得不首先先将消息 1 删除，然后在消息 2 下再建相同的消息 1。

For example, to reorder an existing message1 below message2, you would need to first delete message1 and then recreate the same message1 below message2.

youdao

I'm gonna tell you go sort the left, go sort the right, and then I'll merge the two together.

那先对左半部分排序，再对右半部分排序，然后将两者合并起来。

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

Where those pieces, I would do the same thing with, I would divide them up into smaller chunks, and sort those. Is that going to give me a more efficient algorithm?

合并起来，而那些小列表,我又会把他们拆成更小的列表,再排序，这会给我,一个更高效的算法么？

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

The fact that the picture is a little prettier on the far right is testament to the fact that I'm sorting the left half, the left half, the left half, and that's why you get these little triangles, triangles, triangles, that then get merged together.

可以看到最右边的画面,变化很快,先对左半部分排序，然后再左半部分，这就是为什么会有这些小三角形，最后再将它们合并起来。

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