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

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

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

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

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

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