• And I don't know why, but since time immemorial that is the way computer scientists have drawn trees.

    叶子是在最下面的,我不知道为什么,但从记事以来他们就是这么画树的,这也许就是为什么我们。

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

  • Now the first passage is in Gadamer's text on page 735, the very bottom of the page, and then I'll be going over to page 736.

    我们要看的第一篇文章是伽达默尔写的,第735页最下面,一直到736页。

    耶鲁公开课 - 文学理论导论课程节选

  • Then I want to note the transition that happens at the very bottom of this page after he says, "I was chastened whenever I remembered that my mother had come close to killing me."

    我想强调的是,这页最下面的转折,他说完“一想起母亲过来揍我,我就会很听话“之後“

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

  • And I'll also remind you, and we're going to see this in the next example, we talked about looking at the worst case behavior. In these cases there's no best case worst case, it's just doing one computation.

    我还要提醒大家的就是,我们也会下一个例子里发现者一点,我们谈到了要去考虑坏的情况,下面这些例子里,没有好情况坏情况之分,就只是一次运算。

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

  • So part three down there at the bottom we've got an example of polyphony where I take in the tune and set it against itself a little bit.

    在最下面的第三部分,我已经把那小曲做成了复音的例子,和它自己有所对比

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

  • Merritt Hughes usefully notes this in one of the notes at the bottom of the page, that Milton in that line, "things unattempted yet in Prose or Rhyme," Milton's actually alluding to the opening of another romance epic.

    梅里特修斯发现,这页最下面有一条笔记,显示弥尔顿写到,“《散文和韵律》中都未被人们尝试过的事“,事实上弥尔顿是暗指另一部浪漫史诗的开头。

    耶鲁公开课 - 弥尔顿课程节选

  • Remember, because that 1 s orbital is all the way down in terms of if we're thinking about an energy diagram, we're all the way down here, so we have a huge amount of energy we have to put into the system in order to eject an electron.

    还记得吧,因为1,s,轨道能量示意图里,是在最底部的,我们要一直到最下面,所以我们要向这个系统注入非常大的能量,才能打出一个电子。

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

  • Now at the very bottom, should we see a default case.

    在最下面,我们会看到一个default,分支。

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

  • And then I go back and I start again, and I do the same thing.

    跑完了一遍,它总是在最下面,然后我回来再做一次。

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

  • It was as if, when we went through this search tree, we never remembered what we got at the bottom, and we just re-computed things over and over.

    如果当我们遍历完这棵树,我们不可能,记得我们在最下面得到什么结果,我们只是不断地重复计算,所以这让。

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

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

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

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