Now. Two other things, before we do this last example. One is, I'll remind you, what we're interested in is asymptotic growth.

好，我们看最后的例子之前还有两件事情,第一是，我要提醒大家，我们感兴趣的是渐进的增长率。

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

Now, we concluded last week at looking at sorts and efficiency, some new notation called asymptotic notation and we'll continue that story today.

上周我们着眼于排序和效率问题，并提出一些渐近线的新符号,今天我们将继续讨论相关内容。

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

I just go down the list selecting the smallest person at a time and then I repeat, repeat, repeat but when we actually did out the math or kind of reason through it, the running time, the asymptotic running time of bub-- of Selection Sort was also what?

只需要遍历列表，每次找出最小的元素,然后重复上述步骤，但从数学角度看,选择排序的时间复杂度,又是多少呢？

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

Now, does this jive with our little asymptotic claim here, our little analysis with N notation?

那么这与用N表示法所，得出的结论是否一致呢？

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