They have been charged with being elected on the Change and Reform list, and this causes us grave concerns,".

VOA: standard.2009.04.09

The last thing I want to point out to you is, I started out with this list. I haven't added anything to the list, right? I mean I've got a different kind of looping mechanism.

我们从这个列表开始，我没往这个列表上加任何东西对不对？,我的意思是我学会了一种不同种类的,循环机制，我想我得说。

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

So the first thing we'll do is, we'll print the element, in this case it will be a list right? Because it's a list with two lists in it.

因此这儿我们要做的第一件事，就是要显示元素，在这儿元素就是数组了对不对？,因为这个数组包含了两个数组。

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

Well, notice again, on each level of the tree, when I actually do the merging, so this remember, is when I wrote down just the numbers when I bottomed out with the list of size 1.

请注意，在这棵树中的每一层，我真正做合并时，就将每个大小为1的列表中的,数字写下来。

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

In the Nicomachean Ethics Aristotle provides us with a vivid list ofthe psychological and even physical characteristics that such a person must possess Megalopsychos this megalopsychos.

在《尼各马可伦理学》中,亚里士多德,为我们提供了一份,生动的心理与生理特征清单,这类贵族必定具备,此种。

耶鲁公开课 - 政治哲学导论课程节选

Let's start with the first, with A on this list here.

让我们首先从第一个问题开始

耶鲁公开课 - 生物医学工程探索课程节选

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.

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

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

And this is now consistent with my claim that I have sorted a list of size N equals 1.

这与我之前所说的是一致的,我已经将N为1的一个序列排好了序。

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

Let's suppose, we'll start with the list, I'll call it l 1. This, by the way, is a really bad thing I just did.

让我们假设有一个名为l1的数组，顺便说下，这真是挺糟糕的。

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

With this, if I can assume that accessing the i'th element of a list is constant, then you can't see that the rest of that analysis looks just like the log analysis I did before, and each step, no matter which branch I'm taking, I'm cutting the problem down in half.

读取数组中的第i个元素,是个常量时间的操作的话，我也就能像以前那样得到,这个算法是对数级复杂度的分析,并且每一步不管我选择哪个区间，我都可以把问题的规模缩小一半。

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