N log N is not nearly as good as log N. As a sanity check, what algorithm have we seen that runs in log N time?

而N，log，N和log，N并不一样，我们之前探讨过的哪个算法其时间复杂度是log，N呢？

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

So, let's do a little sanity check now and let's try to demonstrate as much I now claim I'm going to capitalize the copy of the string I just made.

多以，让我们做一个检查,然后做一个演示，现在我声称,我要利用那个字符串的拷贝。

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

So just as a little sanity check, number 15 in binary would be?

再来做个测试，那么二进制中15怎样表达？

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

include stdio h The next line of code says include standard io.h which just as a little sanity check contains among other things, printf.

接着的一行代码写着,这个库文件包含一些我们常用的函数,譬如，printf函数。

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