• It should be clear to everyone that we will not repeat the mistakes of the past.

    VOA: standard.2009.12.05

  • I could sort of sit there and try to track the lines, but I have to repeat it.

    我差不多能试着去跟随旋律线,但必须反复听

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

  • But if you don't pass AS, then you have to maybe repeat it or you can just maybe go to work.

    但是如果你没有通过AS,那么你可能必须重读一次,或者你可以直接去工作。

    英国的高考 - SpeakingMax英语口语达人

  • And sometimes it's not good to repeat it too often; then you start to become unhinged.

    有时重复太多遍也不太好;,你会开始变得神经错乱。

    耶鲁公开课 - 现代诗歌课程节选

  • So, I've been asked that if a question is not very clear, I should repeat it so that people listening to it later will know what the question was.

    工作人员要求我,如果某个问题听得不清楚,我就需要重复一遍,好让今后观看视频的人弄清楚问题是什么

    耶鲁公开课 - 基础物理课程节选

  • So I'll just repeat it to make sure everyone hears it.

    所以我重复一遍,让大家都听清楚

    耶鲁公开课 - 博弈论课程节选

  • I'm going to repeat this a second time, because it's important. These local bindings do not affect any global bindings.

    因为这非常重要,这些本地绑定,并不影响全局绑定。

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

  • And if I remember at least, I will repeat the question out loud so that everybody can hear it.

    至少我肯定会记得,把问题大声的重复一遍,那么所有人都可以听到了。

    耶鲁公开课 - 死亡课程节选

  • Figure out how you can make it move a little to the left, a little to the right, up and down and then repeat in some kind of looping structure.

    就是找出办法让它向左移动一小步,向右移动一小步,向上一小步,向下一小步,像这样不断重复。

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

  • For example, by the way, the compulsion to repeat nasty episodes, - to revisit trauma, and to repeat the unpleasurable-- well, that could just be called masochism, couldn't it?

    举个例子,强迫性地重复那些凶的片段,去重温创伤,重复不愉快-,不正是一种性虐待吗?

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

  • It just surprised everyone so it was not a repeat of this.

    它使所有人惊讶,所以它不是这次危机的翻版。

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

  • In the arts generally people who teach you the arts are going to shudder if you would say oh I interesting in this because it's such fun, because it tells you what life is like or tells you a story and then you'll repeat the story.

    艺术一般来说,如果你对教你们艺术的人,说,哦,我对这个很感兴趣,因为它很有趣,因为它告诉你生活是什么,或说它告诉了你一个很好的故事,他会很震惊。

    麻省理工公开课 - 电影哲学课程节选

  • You can say a polymer of DNA, for example, is four bases long, that means it has four of these repeat units and they go in the sequence from 5' to 3' of .

    打个比方,要描述一个由,四个核苷酸单位构成的寡聚DNA,就是说它由四个核苷酸单位构成,并且从5'端到3'端的顺序为

    耶鲁公开课 - 生物医学工程探索课程节选

  • I've already told you but I'll repeat it.

    我已经说过了,但我还是重复一下

    耶鲁公开课 - 博弈论课程节选

  • I just go down the list selecting the smallest person at a time and then I repeat, repeat, repeat but when we actually did out the math or kind of reason through it, the running time, the asymptotic running time of bub-- of Selection Sort was also what?

    只需要遍历列表,每次找出最小的元素,然后重复上述步骤,但从数学角度看,选择排序的时间复杂度,又是多少呢?

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

  • He says, "to succeed in many things or many times is 'difficult.' For instance, to repeat the same throw of dice 10,000 times would be impossible; whereas, to make it once or twice is comparatively easy."

    他说,要成就很多事情,或成就一件事情很多次,是很困难的,比如,掷一万次骰子都得到同样的结果,是不可能的,但是,掷一两次却是相对容易的

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

  • And that idea was, we make a guess in the middle, we test it so this is kind of a guess and check, and if the answer was too big, then we knew that we should be looking over here. If it was too small, we knew we should be looking over here, and then we would repeat.

    这些有理数是有序排列的,然后我们的想法是,首先在中间取个数作为猜想数,然后对这个猜想数进行验证,如果由猜想数得到的答案太大,我们知道应该跳过,比猜想数大的那个区间,如果太小的话。

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

  • So unlike Scratch where you pretty much had to say "repeat" ten times or whatever, or forever where it's just "forever" with for loops, -- can you actually specify a finite number of iterations -- and as I learned 15 years ago, finite is important.

    所以不像Scratch,你大致上需要用,“repeat“10次或更多,或者需要不断地使用当它,是死循环时,你们能够指定出一个有限的迭代次数-,像我15年前学的,有穷的是重要的。

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

  • I was just finding very tunnel vision-like, the smallest elements at that moment in time which means I don't know anything about the other elements other than they are not the smallest and so no matter what with Selection Sort I had to repeat this again and again and again and if you do out the math it's roughly N squared steps in the worst case as well.

    我只有一个狭窄的视野,只知道某时刻的最小元素,就意味着我并不知道其他元素的任何情况,只知道它们不是最小的,所以不管怎样,在选择排序中,我就得一遍一遍地重复选择过程,在最坏情况下,大概需要N的平方次比较。

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

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

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

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