• Once each time. Right? I only do one swap potentially, it-- though not one potentially, each time at the end of the loop I do a swap.

    每次循环做一次,对么?我其实,就可能做了一次交换,也许并不是可能,每次循环的结束我都得做一次交换。

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

  • But now each time I come, it's a little bit easier each time.

    但是,现在每次我来,一次一次要畅通。

    我使用自行车 - SpeakingMax英语口语达人

  • It implies that this algorithm is calling itself again and again, and again, and on each time the size of the problem I'm trying to sort is being divided by what?

    这就说明此算法会一次一次地调用自己,每次我要排序的问题规模大小,会除以多少呢?

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

  • I'm walking along the list once, taking two things and saying, make sure the biggest one is next.

    我遍历一次列表,每次取两个值,确认最大的元素在后面一个。

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

  • I think most and you are familiar with the Aufbau or the building up principle, you probably have seen it quite a bit in high school, and this is the idea that we're filling up our energy states, again, which depend on both n and l, one electron at a time starting with that lowest energy and then working our way up into higher and higher orbitals.

    我认为你们大多数熟悉奥弗堡,或者构建原理,你们可能,在高中见过它,又一次,这是我们填充能级的观点,与n和l有关,一个电子每次从,最低的能级开始,然后以我们的方式上升到,更高更高的轨道。

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

  • When I started merging, I did merging three times across this whole board, this level, this level, and this level, and each time because of the way I was advancing my fingers I touched each number just once.

    在整个过程中,我一共做了,三次合并,这一层,这一层,和这一层,而且每次,由于要前移手指,因此对每个数字,仅仅移动了一次

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

  • There we go. Now if I do this, an infinite number of times, we should get roughly 50/50, but now we have the ability to do things only once in awhile.

    开始,如果我们,不停地按这个按钮,我们大致会有一半的机会听到猫叫,但是我们每次只有一次按按钮的机会。

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

  • > So now that might not have felt like the fastest algorithm but think about what you could have done with that algorithm in each iteration, much like the phonebook up front here, you literally split that problem in two because on each iteration roughly half of you were sitting down and then another half and then another half.

    虽然这并不是最快的算法,但如果把这种算法每次迭代,就像刚才查电话簿一样,你便将这个问题一分为二了,因为每一次迭代后只有一半坐下来,以此类推。

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

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

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

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