What we really want to worry about is, as the size of the problem gets larger, how does this thing grow? How does the cost go up?

随着问题规模的变大，解决问题花费的代价是怎么增长的,因此我们将会主要地讲讲？

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

And how about if the array is size N, and I say bracket N, where am I referring?

如果那个数组的大小为N，那会怎么样，我指明，涉及到了那个地方？

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

And that's just a way of reminding you that we want to think carefully, but what are the things we're trying to measure when we talk about complexity here? It's both the size of the thing and how often are we going to use it? And there are some trade offs, but I still haven't said how I'm going to get an n log n sorting algorithm, and that's what I want to do today.

这只是在提醒你们我们要仔细的思考问题,但是当我们在讨论复杂性的时候,我们到底要衡量哪些东西？,是列表的大小和对其进行查找的频率吗？,这里面临一些取舍,但是我还没有说明,怎样得到一个n，log，n复杂度的排序算法,并且这是我今天想要讲的内容。

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