So, if we think about the second case here where we have c n minus, now we're talking about a molecule with a net charge of negative 1.

那么，如果我们考虑的是第二个例子,也就是氰离子，那么现在我们讨论的是一个净电荷量为负一的分子。

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

So, let's try another example here, and let's try a case now where instead of dealing with a neutral molecule we have an ion, so we have c n minus.

那么，让我们来试一下另外一个例子，这次不是一个中性原子,而是一个离子，氰离子。

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

N But it's definitely not one and in fact it wasn't N in the case of Selection Sort because remember the algorithm we implemented on stage last week had me going back and forth across the stage selecting on iteration, the smallest person I can find, the smallest number and then putting them into place.

但在选择排序中，肯定不会是1，也不是,注意，上周我们在这儿,实现的算法中，反复地,迭代进行选择，选出最小的数,然后将其放在合适的位置。

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

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.

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

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

In the linear case, meaning in the unsorted case what's the complexity of this? k times n, right? Order n to do the search, and I've got to do it k times, so this would be k times n.

复杂度是多少？k的n次方，对吧？,在序列n中做搜索，要做k次，所以是k的n次方次,如果先排序后搜索。

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

So, if we took the case of nitrogen, if we add an electron to nitrogen and go to n minus, we find that the change in energy is 7 kilojoules per mole.

如果我们以氮为例，如果我们给氮增加个电子令它变成-1价的氮，我们会发现能量的变化是，7，千焦每摩尔。

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

So I propose this as a new algorithm for sorting N elements and being 8 in this case or really a thousand in the case of the phonebook, or anything of larger size.

所以我提出一种新的算法，来解决N个元素的排序问题,在这个问题中N是8，在电话簿的问题中N是一千,或者是大规模的任何问题。

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

Thank you. Sorry, I've got the wrong glasses on but you're absolutely right, and in case the rest of you didn't hear it, n squared.

我看不清，但你绝对是对的,你们其他人可能没听清,是n的平方。

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

I've got to test to see if I'm in the base case, and if I'm not, then I need to move a tower of size n minus 1, I need to move a tower of size 1, and I need to move a second-sorry about that a second tower of size n minus 1.

首先我看看我是不是在最基本的情况，如果不是的话，我得先做一个N-1个，圆盘的移动，移动一个圆盘,然后再做一次N-1个圆盘的移动。

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