It turns out there's a new function strlen S-T-R-L-E-N that you probably have not used yet called strlen, S-T-R-L-E-N, programmers early on and still like to be succinct but communicates sufficiently what they mean.

结果这里有个新的函数,你可能没有使用过，叫做，早期的和现在的程序员喜欢简洁地,但是能充分的传达他们的意思。

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

We didn't just need that n, not just the principle quantum number that we needed to discuss the energy, but we also need to talk about l and m, as we did in our clicker question up here.

我们不仅需要ｎ,不仅要这个可以,决定能量的主量子数，还需要ｍ和ｌ,就像我们做这道题这样。

麻省理工公开课 - 化学原理课程节选

It's going to weigh too much, we don't need to look at it. But it'll still be order 2 to the n.

我们没必要去看它,但是它还是要遵循2到n的顺序。

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

Once I have it sorted I can search it in log n time, but that's still isn't as good as just doing n. And this led to this idea of amortization, which is I need to not only factor in the cost, but how am I going to use it?

一旦对其完成排序,就可以在log，n的时间内对其完成搜索,但是这样做仍然不如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复杂度的排序算法,并且这是我今天想要讲的内容。

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