And we haven't seen all of these sorts, but it's actually quite neat to recognize how different the underlying work is of each of these algorithms.

我们还没有探讨所有的排序算法，但应该很容易区分,每一种算法其内在的,不同之处。

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

But how we can bring those together to recognize and appreciate one other?

我们怎样才能融合双方的不同,学会互相欣赏，互相尊重？

普林斯顿公开课 - 人性课程节选

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的算法,因为它有一个特定的性质。

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