也就是一个分子在格点中可能的位置数，这就是简并度。

And the number of choices of putting that one molecule is anywhere on the lattice. That's your degeneracy.

youdao

这样，对孤立系统，能量的简并度是,粒子位置可能的状态数。

So, if the system is isolated, then the degeneracy of your energy is just a number of waysthat you can flip the positions around.

youdao

如果你要找到，这个位置的数是什么，那你就往左，和往上看，然后用它们做点乘。

And, if you want to find what goes in a given slot here, then you just look to its left and you look above it, and you do the dot product between these guys.

youdao

But if, at any point, I get to a place in the list where the thing I'm looking for is smaller than the element in the list, I know everything else in the rest of the list has to be bigger than that, I don't have to bother looking anymore.

比当前位置数组的元素要小,我也就知道后面的数肯定,也都比我的目标数要大了，我就不用再继续进行下去了,这意味着目标数不在这个数组中，我就可以退出了。

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

If it's there, I'm done, if not, I keep walking down, and I only stop when I get to a place where the element I'm looking for is smaller than the value in the list., in which case I know the rest of this is too big and I can stop.

并且保持遍历,我只在当当前位置的数组元素,大于目标数时停止,这意味着剩下的元素都比目标元素大，但是其他的情况,我还是要遍历完整个数组。

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

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

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