C-A-T-W-O-M-A-N."

VOA: special.2009.06.07

He urged revival of the slave-trade in the late 1850s, and he developed a theory of what he called warranteeism--w-a-r-r-a-n-t-e-e-I-s-m.

他促成了十八世纪五十年代后期,奴隶交易的复苏,还自己发明了一套理论,名为抵押品主义

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

Why didn't they keep right on going with G, H, I, J, K, L, M, N, O, P?

为什么他们不接着写下去呢,按照字母表

耶鲁公开课 - 聆听音乐课程节选

Again, the reason for that is because the energy only depends on the n value here, it doesn't depend on l or on m.

因为，能量,只和n的值有关，与l和m的值无关。

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

Let me show you one more class, though about-- sorry, let me show you two more classes of algorithms. Let's look at the next one g- and there's a bug in your handout, it should be g of n and m, I apologize for that, I changed it partway through and didn't catch it.

请大家看，额,在你们的课堂材料中有个错误,应该是g，很抱歉-,我改了一部分这个错误但是没看到这里的，好，这儿的增长率，有人想猜猜么？

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

If I'm using algorithm that I'm now calling merge sort, T the running time involved in sorting N elements, T of N, you know, is just the same as running the algorithm for the right half, plus what's this plus N come from?

如果我用归并排序算法，对N个元素其运行时间，就等于此算法一半元素的运行时间,另一半的运行时间，再加上N，这个N是什么呢？

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

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复杂度的排序算法,并且这是我今天想要讲的内容。

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