It says some countries are making good progress toward meeting the U.N.

VOA: standard.2009.05.21

So if you're trying to make a more complicated organic molecule carbon-carbon bonds are one of the most difficult things to make in organic chemistry, and it turns out that c n minus is a very reactive molecule, so it's a good way, even though we'll go over some drawbacks in a second, it is a good way to make carbon-carbon bonds.

如果你要合成一个更复杂的有机分子,碳碳键是有机化学中,最难制造的键之一，而实际上氰离子是一种具有很高活性的分子，用它是一个好办法，尽管我们一会儿将看到它的一些缺点，但它的确是一个制造碳碳键的好方法。

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

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, it would be a good question to ask n why are we limited clearly there's this relationship between l and n, and we can't get any higher than n equals one.

那我们要问了,为什么我们被限制了，很明显，l和,有关系，为什么不能取到，n-1更大的值。

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

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的复杂度,这样做引出了耗时分摊的想法,这时不仅需要考虑耗时的因素？

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