By that he meant, he did not need a co-president, which some people often said what the WHCF was.

他的意思是，他不需要一个联合总统，这也是人们,经常用来形容我们的。

普林斯顿公开课 - 国际座谈会课程节选

He is often said to be the second most powerful man in the country after the president who is the most powerful man not only in the US, but also in the world.

他经常被人们称为,位列总统之后,国家里面最有权力的人,而总统不仅是美国,而且在世界上，都是权力最大的人。

普林斯顿公开课 - 国际座谈会课程节选

I said that if I was really hygienic, and you can now wonder about how often do I shower?

但是这真的很棒，对不对？,那么为什么我要说这些呢？,我说过如果我真的很讲卫生的话？

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

Often,we just don't know how it got it, and it just happened because somebody just said, "It's authoritative. It must've been written by an apostle."

我们通常都不知道它是如何来的，它已经成了事实，因为有人说，“它具有权威，肯定是由一位使徒所写“

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

It's a worldview often obsessed, as we said last time, with notions of honor and duty.

如我们上次所说,这是个,经常执着于荣誉和责任观念的世界观

耶鲁公开课 - 美国内战与重建课程节选

Because they said the experiment must go on, very often, people went-- most people, Americans went on and shocked that person, even to the point of the other person whimpering and begging to be let out, simply because of the word, " "the experiment must go on".

因为他们说实验必须进行下去，经常的，人们会-,多数人，美国人都会继续电击那个人，甚至电击到另一个人哭泣,恳求放他出去，仅仅是因为那一句，“实验必须进行下去。

哈佛公开课 - 幸福课课程节选

The Chief of Staff is often said to be the secnond most powerful man in the country, after the president who is the most powerful man not only in the United States, but also in the world.

办公厅主任被称为,国内第二有权利的人，仅次于美国总统,总统不仅在美国权力最大，在世界上也是如此。

普林斯顿公开课 - 国际座谈会课程节选

Some of which I built: cmp, init, str. And there, notice, are the internal definitions And in fact I should've said, we often call those things fields.

就是给我一个所有东西的列表：,所有的方法，与这个类关联的，有一些是我写的：,还有这里，请注意，是一些内部的定义。

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

And that's just a way of reminding you that we want to think carefully, but what are the things we're trying to measure when we talk about complexity here? It's both the size of the thing and how often are we going to use it? And there are some trade offs, but I still haven't said how I'm going to get an n log n sorting algorithm, and that's what I want to do today.

这只是在提醒你们我们要仔细的思考问题,但是当我们在讨论复杂性的时候,我们到底要衡量哪些东西？,是列表的大小和对其进行查找的频率吗？,这里面临一些取舍,但是我还没有说明,怎样得到一个n，log，n复杂度的排序算法,并且这是我今天想要讲的内容。

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