And we talked about the equation you can use for radial nodes last time, and that's just n minus 1 minus l.

我们讲过这个用于,计算径向节点的方程，也就是ｎ减去ｌ减去１

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

Boy, there's a dumb question, because I've been telling you n log n for the last two lectures the complexity is n log n, but let's see if it really is.

孩子们，这是一个愚蠢的问题，因为前两节课的时候我就已经告诉你们了,复杂度是,但是让我们来看一下是不是真的是这样。

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

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，也不是,注意，上周我们在这儿,实现的算法中，反复地,迭代进行选择，选出最小的数,然后将其放在合适的位置。

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

The conflictedness that Milton is encapsulating here is probably most intense in the last lines of this wonderful stanza: / "With flow'r-inwov'n tresses torn / the Nymphs in twilight shade of tangled thickets mourn."

弥尔顿在这想要化解的冲突,可能在这一段中最激烈：,少女的头发被扯断/,黄昏时在杂乱的灌木丛中哀叹“

耶鲁公开课 - 弥尔顿课程节选

And the last thing we can think about is how do we name this n h bond, and again, we just name it based on it symmetry.

最后我们要讨论的是,如何命名这个NH键，同样，我们基于它的对称性命名它。

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

So there are two electron configurations in the n equals one shell, if we follow according to the selection rules that we spelled out last day.

如果根据上次课,我们阐明的原子光谱选择定则，我们就会知道在n等于1的那一层,有两种电子图像构型。

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

Remember, we saw that last time looking at the binary numbers. 2 to the n is a big number.

还记得吗，我们上次看过的二进制数,从2到n是一个很大的数。

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

to the n, every value in the 1 bit vector we looked at last time is either 0 or 1. So it's a binary n number of n bits, 2 to the n.

从2到n，我们上次看到的,位向量的每个值不是0就是,所以它是n，比特的二进制数,从2到。

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