That's m-a-c-a-r-o-n.

VOA: special.2010.04.12

STUDENT: PROFESSOR: Oh, I'm sorry. So it's n minus l minus 1.

学生：,教授：不好意思，这是ｎ减去ｌ减去１．

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

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.

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

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

n l m s Once we have chosen a certain mix of n, l, m and s, it is used once for that particular atom.

一旦我们选定了一组量子数，它就只能被一个固定原子所有。

麻省理工公开课 - 固态化学导论课程节选

In the case of Nimes, N-I-M-E-S, which was largely a Protestant town, they knocked down the wall so the Protestants of Nimes could not defend themselves against this all-conquering Catholic monarch.

以尼姆为例,那儿曾经是一座新教徒的城市,但统治者们拆毁了围墙,所以新教徒们再也无法对抗,所向无敌的天主教统治者了

耶鲁公开课 - 欧洲文明课程节选

N 6 Sixteen, so that's 16 times log base 2 of 16 and though I'm writing small here, log base 2 of 16, 16 this gives me 4 'cause 2 to the 4 equals 16.

是多少呢？，Well，，N，is，what？,16，那就是16乘以以2为底16的对数6,在这儿我将2写小一些，以2为底16的对数是4，因为2^4等于。

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

Log n Log n, because at each stage I'm cutting the problem in half. So I start off with n then it's n n/2 n/4 n/8 over two n over four n over eight.

因为总共有多少层？,因为在每一层，我都是把问题分解成两半,因此以n开始，然后是。

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

Every Saturday morning I'm going through Stop 'N Shop and there's Nora Jones in the background playing.

每周六我都会路过"Stop 'N Shop"超市,那里总在放诺拉·琼斯的歌

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

Just by n, l, m, s is inadequate.

仅仅靠n，l，m，s是不够的。

麻省理工公开课 - 固态化学导论课程节选

So I'm not going to worry whether this item is a vase or a watch or painting I'm just going to say it's the n'th element.

所以我不用担心这个物品,是花瓶还是手表或者油画,我只要说这是第n个元素就好。

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

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，很抱歉-,我改了一部分这个错误但是没看到这里的，好，这儿的增长率，有人想猜猜么？

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

I put it in n. So here's where I'm pushing back.

我把它赋值给n，我把它放回这里。

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

s We are back over to E as a function of n, l, m and s, only we got there through this other torturous route.

我们回到将E作为函数n，l和，只要我们解决了这个烦人的路径。

麻省理工公开课 - 固态化学导论课程节选

Then I'm declaring a variable called n, it's of type int.

然后我声明了一个变量n，它是int型的。

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

If I want to move this stack here, I'm going to take a stack of size n minus 1 move it to the spare spot, now I can move the base disk over, and then I'm going to move that stack of size n minus 1 to there. That's literally what I did, OK?

如果我想移动这些圆盘，我先把从n-1个圆盘1,移动到多余的柱子上去，这样我就能把最底下的圆盘放到这儿了，然后再把从n-1个圆盘放到这儿来,这就是确切的我怎么做的对不对？

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

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

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