Negative 1 plus 0 should add up to negative 1, if in fact, we're correct for the c n anion.

负一加上零应该等于负一，如果是这样，我们对于氰离子的结果就是正确的。

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

It at least does corroborate the claim that merge sort N*log N as we argue intuitively is in fact, N log N in running time.

但这至少证实了归并排序,的时间复杂度为。

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

So if we say that l is just talking about our kinetic energy part, our rotational kinetic energy, and we know that electrons have potential energy, then it makes sense that l, in fact, can never go higher than n.

如果我们说，l仅仅是,描述动能项，我们的旋转动能，我们知道，电子有势能，所以可以理解，l不能比n高。

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

First there was the observation by Michelson who back in the late 1880s had done very precise interferal metric measurements of the hydrogen lines and had observed that the 656 nanometer line 3 associated with the transition of n equals 3 to n equals 2 was, in fact, a doublet.

首先是麦克逊,在1880年底的观察,他以公制单位对氢原子的光谱线,作了准确的，无其他因素干扰的，测量,发现当n值由3变为2时,会同时得到波长为656纳米的谱线3,实际上是有两条线。

麻省理工公开课 - 固态化学导论课程节选

N But it's definitely not one and in fact it wasn't N in the case of Selection Sort because remember the algorithm we implemented on stage last week had me going back and forth across the stage selecting on iteration, the smallest person I can find, the smallest number and then putting them into place.

但在选择排序中，肯定不会是1，也不是,注意，上周我们在这儿,实现的算法中，反复地,迭代进行选择，选出最小的数,然后将其放在合适的位置。

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

Like what the heck have we been spending our time for-- our time on with Bubble Sort and with Selection Sort and in fact there's plenty of other N squared sorts that we're not even gonna bother looking at.

真见鬼，我们竟然在-,冒泡排序和选择排序上花时间,而事实上，还有很多我们根本都不想考虑的,复杂度为N平方的排序方法。

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

And, in fact, it can't even reach n, because then we would have no potential energy at all in our electron, which is not correct.

事实上，它连n都达不到，因为如果那样的话,电子就没有势能了，这是不可能的。

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

I now have a list of size 1 so N is, in fact, less than 2.

现在序列的大小是1，可见N小于。

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