The idea behind all these algorithms is that what's ultimately important is how many comparisons you ultimately need to make.

这些算法的思想是,你最终需要做多少次的比较,这才是真正重要的。

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

Selection sort too really reduces to a total number of comparisons because I'm again comparing the current smallest to the next thing I see, the next thing, so really a lot of these sorting algorithms boil down to comparisons and the numbers that you actually have to make.

选择排序也可归纳为总数的比较,因为要将当前最小者与下一个进行比较,接着再下一个，可见,很多排序算法都可归结为比较,以及需要比较的次数。

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

And when we make these comparisons, one thing I want to point out is that we need to keep the constant principle quantum number constant, so we're talking about a certain state, so we could talk about the n equals 2 state, or the n equals 3 state.

当我们做这些比较时，我想指出的一件事是,我们需要保持常量原则,保持量子数是常数，所以我们在讨论一个确定的态时，我们可以谈论n等于2的态，或者n等于3的态。

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