But they don't have a set list of things that make something the canon.

但他们没有列出一系列东西,让它们成为正典。

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

So if I call, let's , let's set up s to be, I don't know, some big long list.

那让我们来调用一次吧，让我们建立一个，怎么说。

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

For our purposes, I think that won't be crucial, and so I'll sometimes talk about this set of abilities without actually having a canonical list.

但鉴于课程的目的,这点并不在我们的讨论重点之内,所以我也许偶尔会提及人的这些能力,但并不会把它们详尽地列举出来

耶鲁公开课 - 死亡课程节选

If I want to create a set or a sequence representing these things, I simply insert into that list.

如果我想创建一个集合,或者一个序列表示这些东西，我只要简单的把它插入列表中。

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

Again. Basic premise of binary search, or at least we set it up was, imagine I have a sorted list of elements. We get, in a second, to how we're going to get them sorted, and I want to know, is a particular element in that list..

好，二分查找的基本前提，或者是我们建立二分查找的基础,我们已经有了一个排好序的元素列表，我们就需要知道如何来快速的排序,如何从列表中找到特定的元素。

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

I've added the ability to have more complex data structures here. But I dropped a hint in the first lecture about what you could computer with things. In fact if you think for a second about that list, you could ask what can I compute with just that set of constructs?

我添加了使用更复杂的数据结构的能力,但是我在第一节课给大家了了一个,关于你可以用什么来做计算的暗示,实际上如果你思考,这个列表一会儿的话,你会问我可以用？

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

So I'm going to go over here, and I'm going to type test search-- I can type and if you look at your handout, it's just a sequence of tests that I'm going to do OK. So initially, I'm going to set up the list to be the first million integers.

大家可以看看你们的课堂材料，那儿有一些我要做的实验,好，一开始我先去建立个，含有一百万个integer的数组,对，这有点儿简单,但是这给我提供了这样一个有序的数组。

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