• 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

  • So notice a difference in these structures, is this has an n h bond whereas this has an o h bond.

    注意它们之间的有一点不同,那就是一个有氮氢键,而另一个有氧氢键。

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

  • I could still do the linear case, which is order n or I could say, look, take the list, let's sort it and then search it. But in that case we said well to sort it was going to take n log n time, assuming I can do that.

    我仍然可以做O的线性搜索,或者也可以以这个列表为例,我们先将其进行排序,然后再进行查找,但是在这种情况下,要花费n,log,n的时间去对其进行排序。

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

  • "That's kind of fun!" "What's your name?" "Broklin,B-R-O-K-L-I-N."

    VOA: special.2010.04.30

  • Well, this question mark becomes an O, this question mark becomes an O, and then the loop terminates 0 1 2 because it's iterating from zero to N so that's zero, 1, 2 and the length of the string is 3 so the loop terminates, but I remember that I needed to have this special sentinel value so I'm just going to put it there manually.

    嗯,这个问号变成了,这个问号变成了0,然后循环结束了,以为迭代从0到N,那就是,字符串的长度是3,然后循环就结束了,但是我记得我需要这个特殊的标记值,所以需要手动的加上它。

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

  • The address is u-s-a-l-e-a-r-n-s dot o-r-g.

    VOA: special.2009.01.15

  • So between b e, and b, between n and o, magnesium and aluminum, and then phosphorous and sulfur, what we see here is that we're kind of going down, or quite specifically, we are going down.

    比如从铍到硼,从氮到氧,从镁到铝,从磷到硫,我们在这些地方看到有点下降,或者可以明确地说,我们确实在下降。

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

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

    VOA: special.2010.04.12

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

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

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

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

    VOA: special.2009.06.07

  • I quote in here a guy who croaks before this course starts, Jean Bodin, B-O-D-I-N.

    在这儿我引用一位逝者提出的观点,金博丹

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

  • O Right there, order n. So I have order n operations at each level in the tree. And then how many levels deep am I? Well, that's the divide, right? So how many levels do I have?

    在这儿,所以我在树的每个层次都要做O的操作,那个这棵有多少层呢?,这是一个除法,不是吗?

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

  • We said each of the merge operations O was of order n. But n is different. Right?

    注意这里发生了什么,我们说过每一次合并操作的复杂度都是?

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

  • There was a huge old insurrection called the Fronde, f-r-o-n-d-e.

    有一起被称为投石党运动的起义

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

  • N --O So we introduced this notation big O which generally refers to worst case.

    的平方。,So,,N,squared。,这里我们介绍一个符号,它泛指最坏的情况。

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

  • This actually I think derives from a Greek word, "Synkope, " S-y-n-k-o-p-e, synkope.

    这个术语我觉得来源于希腊语,Synkope,S-y-n-k-o-p-e

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

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定