• Why don't I just keep track on each pass through the algorithm whether I have done any swaps?

    我为什么不仅仅跟踪算法的,每一遍来看看我做了哪些交换呢?

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

  • All right? Because if I don't do any swaps on a pass through the algorithm, then it says everything's in the right order.

    好么?因为如果我,这一遍没有做任何交换,那么就意味着已经排好序了。

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

  • And in this case, we go from 8 to 4 to 2 to 1 three times and then on each iteration of this algorithm, each pass across the board I'm touching N numbers, so that means I'm doing N things, log N times.

    在这个例子中,我们从8得到4,到2,再到1,是3次,在这个算法的每次迭代中,每一趟我都会操作N个数,也就是所我每次要做N步操作,一共要做,log,N,次。

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

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

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

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