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，也不是,注意，上周我们在这儿,实现的算法中，反复地,迭代进行选择，选出最小的数,然后将其放在合适的位置。

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

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开始，然后是。

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

n It takes discrete values, multiples of some integer n, and the multiplication factor is the ratio of the Planck constant divided by 2 pi where n takes one, two, three and so on.

这些离散的值乘以整数，乘积因子,是普朗克常数除以2π,其中n可以取1，2，3，等等。

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

And the last thing we can think about is how do we name this n h bond, and again, we just name it based on it symmetry.

最后我们要讨论的是,如何命名这个NH键，同样，我们基于它的对称性命名它。

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

It's much better--the uncertainty about x/n is much lower for the case n = 100 than it was for the case n = 1, but it's still there.

当n=100时,x/n的不确定性,比n=1时要小得多,但是不确定性仍然是存在的

耶鲁公开课 - 金融市场课程节选

n If you want a literal percent, it's %% and then backslash n.

如果你想要一个百分比常量，就用%%，然后，反斜杠。

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

And,of course,it just comes from the Greek word canon, spelled with one "n," not two.

当然了，canon一词来源于希腊语，中间只有一个n，不是两个。

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

est-ce pas How long ago it seemed and childish! Yet tender too, n'est-ce pas?

看来多么遥远和幼稚啊，然而又是含情脉脉的，n’

耶鲁公开课 - 1945年后的美国小说课程节选

We're going to get to more complicated atoms eventually where we're going to have more than one electron in it, but when we're talking about a single electron atom, we know that the binding energy is equal to the negative of the Rydberg constant over n squared, so it's only depends on n.

我们以后会讲到，更加复杂的情况,那时候,不只有一个原子，但当我们讲，单个原子的时候，我们知道结合能，等于,负的Rydberg常数,除以n平方，所以它仅仅由n决定的。

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

Perhaps more importantly, how to recognize a kind of algorithm based on its properties and know what class it belongs to. This is a hint. If you like, leaning towards the next quiz, that you oughta be able to say that looks like a logarithmic algorithm because it's got a particular property. That looks like an n log n algorithm because it has a particular property.

也许更重要的是,如何根据一个算法的特点将其辨别出来,并且知道它属于哪一类算法,这是一个提示，就对于接下来的测验来说,如果你喜欢你可以说它看起来像一个对数算法,因为它有一个特定的性质,那个看起来像一个n，log，n的算法,因为它有一个特定的性质。

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

But it grows pretty rapidly, as n goes up, and I'm going to show you an example in a second.

解决问题需要的时间会急剧增长，一会儿我会让大家看个例子的,我想大家注意的还是。

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

All the energies are negative because it is a bound system. I start up here with n equals one.

所有能量级都是负数，因为它是一个束缚系统,在这里我从n等于1讲起。

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

So in other words, every time I merge the point that I kept emphasizing verbally there and that I'm only touching each number once, means that we have to account for the amount of time it takes to merge N which is going to be just N. Now, this is again one of these cyclical answers.

换言之，之前在做合并时,我不停地强调,对每个数字我只碰了一次，这就是说,我们要记录合并所花的时间量,也就是这里的,这又是一种循环性的答案。

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

If you have a sample with n observations, it's the summation I = 1 to n of xi/n--that's the average.

如果你有n个观测值,对Xi从i=1到n求和再除以n

耶鲁公开课 - 金融市场课程节选

If I look at something that goes as n squared, if this is the edge of the nucleus here and if this is r1, 4 it says when n goes to two the radius goes to four.

如果在原子核外侧,我们发现某一半径和n的平方成正比，也就是说当n为2时半径等于。

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

And an electron is something where, i n fact, we might be able to, if we calculate it and see how that works out, actually observe some of its wave-like properties.

如果我们对电子做计算,并且知道如何算出来的,那么我们是可以观测到,电子的一些波动性质的。

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