So, the curious thing about recursion is that pretty much always can you implement this idea of doing the same thing again and again and again but with smaller bytes each time.

可见，递归算法中新奇的一点是,为了实现一个想法,你可以一遍又一遍地做相同的事情,但每次的规模都会有所减小。

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

So, in general what we see, and this is always true if we're comparing the same atom, and in general, if we're comparing different types of molecules, but we know that a single bond is always weaker than a double bond, which is weaker than a triple bond.

通常我们会看到，这对比较相同原子来说总是正确的，通常，如果我们要比较不同种类的分子，但我们知道单键,总是要比双键弱，双键总是要比三键弱。

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