Now you might say, wait a minute. Thing's ordered, if I stop part way through and I throw away half the list, doesn't that help me? And the answer is yes, but it doesn't change the complexity.

如果我在半路上停下来,然后不去遍历剩下的数组了,这会有帮助么？答案是有帮助，但这没法改变算法的复杂度，因为我们之前怎么说来着？

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

What's the complexity? I haven't talked to the side of the room in a while, actually I have.

我这里没有讲过这些,其实是有啦，这位同学帮我讲出来了。

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

This is a little game--and again, don't be overwhelmed by the complexity.

这是一个小游戏，不要被它的复杂性搞晕。

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

And then one of the things that I suggested was that if we could figure out some way to order it, and in particular, if we could order it in n log n time, and we still haven't done that, but if we could do that, then we said the complexity changed a little bit.

这就涉及到了排序,如果可以想出一种来将其进行排序,甚至可以在n，log，n的时间内完成,虽然目前我们没做这件事,但是一旦开始做这件事,那么复杂性就是发生一些变化。

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