So, let's, for example, look at nitrogen. So n 2, we can do the chart here in green, so it's the green dotted line, and what we see is that we have now defined this energy as where the 2 nitrogen atoms are separated.

那么，让我们举个例子，看一下氮，那么氮分子，我们可以把它用绿色曲线画在这，这是绿色的虚线，可以看到,我们已经定义为零点能，当两个氮原子分离时。

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

If we can sort things, you know, we get this n log n behavior, and we got a n log n behavior overall. But can we actually do better in terms of searching.

如果我们可以排序，如你所知，我们有n，log，n级别的算法，并且我有一个整体的n，log，n级别的算法,但是我们在搜索方面可以做的更好吗？

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

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 we know that we can relate to z effective to the actual energy level of each of those orbitals, and we can do that using this equation here where it's negative z effective squared r h over n squared, we're going to see that again and again.

我们知道我们可以将有效电荷量与,每个轨道的实际能级联系起来，我们可以使用方程去解它,乘以RH除以n的平方,它等于负的有效电荷量的平方,我们将会一次又一次的看到它。

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

I could still do the linear case, which is order n or I could say, look, take the list, let's sort it and then search it. But in that case we said well to sort it was going to take n log n time, assuming I can do that.

我仍然可以做O的线性搜索,或者也可以以这个列表为例，我们先将其进行排序,然后再进行查找，但是在这种情况下,要花费n，log，n的时间去对其进行排序。

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

So if we go to the ground state, what you see is we're at that lowest energy level, and we only have one possibility for an orbital, because when n equals 1, that's all we can do.

如果我们在基态上，你可以看到，我们在能量最低的态上，只有一种，可能的轨道，因为n等于1，只有这种可能。

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