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.

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

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

I could sort of sit there and try to track the lines, but I have to 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?

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

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

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've already told you but I'll repeat it.

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

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

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的平方次比较。

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