And we're going to start with one that you many of you, have already bumped into perhaps by accident, which are lists.

曾经遇到过的,可能是偶然遇到的类型来开始,就是数组，数组和字符串类型。

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

Let's go into the third version of this and then start doing something with these constructs.

让我们进入这个程序的第三版,开始用这些概念来写点东西。

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

It's interesting,though,he does list the letters of Paul last, behind the other letters,rather than before them, as we have in our list. And then, we don't really start getting any kind of consistency with this until into the third and fourth and fifth and sixth centuries.

有趣的是他把保罗的书信放到了最后，它被列在其他书信后面而非前面，这跟现代的书目一样，书目最终的确定时间,是在主后第三至第六世纪。

耶鲁公开课 - 新约课程节选

I told you, the way I'm going to teach any subject is going to start with the easiest example and lull you into some kind of security and then slowly increase the difficulty.

我之前讲过,我在上每一门课的时候,都是从最简单的例子开始,先打消你们的顾虑,然后渐渐加深难度

耶鲁公开课 - 基础物理课程节选

Typically up till now, we've looked at things that can be done in sublinear time. Or, at worst, polynomial time. We'll now look at a problem that does not fall into that. And we'll start with what's called the continuous knapsack problem.

至今为止我们已经处理过,亚线性问题，最多也就是多项式问题,我们现在要看的问题则是不能用这些解决的,我们将要开始讲连续背包问题。

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