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?

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

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

Well how many more steps does this algorithm take?

用同样的算法需要多几个步骤？

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

Perhaps more importantly, how to recognize a kind of algorithm based on its properties and know what class it belongs to. This is a hint. If you like, leaning towards the next quiz, that you oughta be able to say that looks like a logarithmic algorithm because it's got a particular property. That looks like an n log n algorithm because it has a particular property.

也许更重要的是,如何根据一个算法的特点将其辨别出来,并且知道它属于哪一类算法,这是一个提示，就对于接下来的测验来说,如果你喜欢你可以说它看起来像一个对数算法,因为它有一个特定的性质,那个看起来像一个n，log，n的算法,因为它有一个特定的性质。

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