So this we would want to delete in order for the code not to run the risk of crashing, but let's now see this was made by an excellent teacher out at Stanford University.

我要按顺序删除它，不要冒崩溃的风险,但是这个是由一个来自斯坦福大学的,优秀教师做的。

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

Within the visible range of what we can see, you also want to know this relative order that's pretty easy -- most of us have memorized that in kindergarten, so that should be fine.

在可见光的范围内，你们要知道它们排列的,相对顺序，这非常简单,你们在幼儿园的时候。

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

Before I do that though, let me try and give you an analogy to keep this in mind of why we want to basically build these abstractions and what we need in order to have them work together.

在我们看例子之前请让我打个比方,以便你们能记住我们,为什么要建立这些抽象,以及要使它们协调工作,我们需要做些什么。

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

So what I want to tell you is we also always get the same bond order if we instead only deal with the valence electrons.

我想要说的是我们如果,只考虑价电子也可以得到相同的键序。

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

So for the bond order we want to take 1/2 of the total number of bonding electrons, so that's going to be 4 minus anti-bonding is 4, so we end up getting a bond order that's equal to 0.

键序等于1/2乘以,总的成键电子数，也就是4，减去反键电子数，也就是4。,所以最后得到键序为0。

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

What we're saying is, in order to do computation, we want to describe recipes, we want to describe this sequence of steps built on some primitives, and we want to describe the flow of control that goes through those sequence of steps as we carry on So the last thing we need before we can start talking about real programming is, we need to describe those recipes.

我们在说，为了做计算，我们想描述一个方法，想描述建立在,相同基本类型上的步骤序列，而且我们想描述经过我们设计的,步骤的序列的，控制流程,因此我们开始谈论真正的编程之前,的最后一件事是，我们需要描述一下那些方法。

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