-
The traditional spelling is d-o-u-g-h-n-u-t but people often just spell it d-o-n-u-t.
VOA: special.2010.04.12
-
We didn't just need that n, not just the principle quantum number that we needed to discuss the energy, but we also need to talk about l and m, as we did in our clicker question up here.
我们不仅需要ｎ,不仅要这个可以,决定能量的主量子数，还需要ｍ和ｌ,就像我们做这道题这样。
-
So, what we have left in our equation is only one part that n we haven't explained yet, and that is that n value.
现在方程里只剩下一个常数,我们还没有解释，这就是。
-
VOA: special.2009.06.07
-
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，也不是,注意，上周我们在这儿,实现的算法中，反复地,迭代进行选择，选出最小的数,然后将其放在合适的位置。
-
But he says the United States can't solve the world's problems alone and it is time for all U.N.
VOA: standard.2009.09.23
-
It's going to weigh too much, we don't need to look at it. But it'll still be order 2 to the n.
我们没必要去看它,但是它还是要遵循2到n的顺序。
-
Why he lied I don't know,". This is the last case before the U.N.Special Court for Sierra Leone.
VOA: standard.2009.11.10
-
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?
为什么他们不接着写下去呢,按照字母表
-
N And we can keep doing"T","A","N", ? and I think you see where it is going.
然后接着移动字母，T，A，和，我想大家应该知道后面是哪些字母了吧。
-
It's the term you see up here. It should be also on that sheet, Tanakh, which is really the letter "t", "n" and "kh", and they've put little "a's" in there to make it easy to pronounce, because kh is hard to pronounce, so Tanach. Okay?
就是这个，这个词应该也在这张单子上，塔纳赫-Tanakh，这字母分别发t，n和kh？,他们在这里加了个a’s，让它变得容易发音？,因为kh这个音很难发出？
-
That's what this is called by Jan Steen, S-T-E-E-N.
简·施特恩就是这么说的 简S-T-E-E-N
-
So,if you take number one--but we don't have to go through them all and I assure you we won't--if you take number one, the Ain,a-i-n,it's named after a river; or if you take number two,the Aisne,a-i-s-n-e, it's named after a river; and how many hundreds of thousands of people died along there in World War One or,you take number three,the same thing,Allier.
如果你看第一个省,我向你们保证,我们不用挨个了解,看第一个省,安省,a-i-n,来自一条河的名字,或是第二个埃纳省,a-i-s-n-e,来自于一条河的名字,有成千上万的人在这里死于,第一次世界大战,第三个,阿列省
-
So, why don't you go ahead and tell me, keeping that in mind, which atom in terms of h c or n would you expect to be in the center of hydrogen cyanide?
那么，请大家来告诉我，并且记住它，你认为氢，碳和氮中哪个原子,应该在氰化氢的中间呢？
-
So, it would be a good question to ask n why are we limited clearly there's this relationship between l and n, and we can't get any higher than n equals one.
那我们要问了,为什么我们被限制了，很明显，l和,有关系，为什么不能取到，n-1更大的值。
-
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的平方。
-
How do I rea-- replace the expression FOR t of n minus 1? Substitute it in again.
我们怎么来代替t这个表达式呢？,再来替换掉它，t等于。
-
And, in fact, it can't even reach n, because then we would have no potential energy at all in our electron, which is not correct.
事实上，它连n都达不到，因为如果那样的话,电子就没有势能了，这是不可能的。
-
But also unlike n, l cannot have just any value, we can't go into infinity.
但不像n，l，不能取所有整数，不能到正无穷。
-
It's gonna be zero if N is less than 2, right.
如果N小于2，T应该是。
-
*t t of n minus 1 is 3 plus 2 t of n minus 2.
加上。
-
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是什么呢？
-
So int n just gives me four bytes for an int, but it doesn't put anything there yet.
所以int，n只是给我们分配了4个字节，但是它没有放任何东西在那里。
-
It turns out there's a new function strlen S-T-R-L-E-N that you probably have not used yet called strlen, S-T-R-L-E-N, programmers early on and still like to be succinct but communicates sufficiently what they mean.
结果这里有个新的函数,你可能没有使用过，叫做，早期的和现在的程序员喜欢简洁地,但是能充分的传达他们的意思。
-
So the running time of the problem where the input is T of size N as expressed here formulaically, T of N, the running time of an algorithm, given an input of size N. You know what?
因此一个输入为N的问题的运行时间,在这儿的公式表示为，如果输入为N，那么此算法的运行时间,是多少呢？
-
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的值无关。
-
> >> David: Yeah, so I didn't have my "backslash n."
>，【无法辨认的声音】,>>，大卫：是的，我没有加入“反斜杠，n“
-
If it doesn't say anything else we do mean n equals 1.
如果没有别的条件我们都指n等于。
应用推荐