• And so one of the things we'll look at today is how can we leverage an algorithm, how can we implement an algorithm that at least at first glance the second time we've now seen it feels so obviously better.

    因此,今天我们要学习的一点就是,我们怎样才能影响一个算法,怎样实现一个算法,使你在第二次看它时会觉得,至少你第一次看到它时更好。

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

  • And so this begs the question, even in the context of these cups, how can we possibly do better if at the end of the day in order to figure out if two cups or if two people or if two ints inside of an array are bigger or smaller than one another it feels like we have to do this comparison work anyway.

    这样就回避了问题的实质,从这些杯子的相互关系来看,我们怎样才能更有效地,找出序列中其他元素,都大或都小的两个杯子,两个人,两个数,看起来我们无论如何都得,做较的工作。

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

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

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

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