But just to hammer home this point, if I could, we have time for one awkward demonstration.

但是这个时候为了再三强调到彻底的了解，如果可以的话，我们还有时间做一个不太好的示范。

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

They are computationally challenged, meaning, at the time they were invented, they were perfectly good sorting algorithms, there are better ones, we're going to see a much better one next time around, but this is a good way to just start thinking about how to do the algorithm, or how to do the sort.

他们是相当棒的排序算法，是有更好的算法，我们下一次,就会看一个更好的，但是开始想想,如何完成算法，或者说是如何排序,是一个好的学习方法,恩，再试试吧,如何来排序呢？

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

OK. We're going to just try this one more time just so you can see it.

好的，我们将要再尝试一次,这样你们就可以看到它。

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

This is ridiculous. Why doesn't he just say one thing at a time?"

这太荒谬了，他为什么不一次只说一件事情？“

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

So in other words, every time I merge the point that I kept emphasizing verbally there and that I'm only touching each number once, means that we have to account for the amount of time it takes to merge N which is going to be just N. Now, this is again one of these cyclical answers.

换言之，之前在做合并时,我不停地强调,对每个数字我只碰了一次，这就是说,我们要记录合并所花的时间量,也就是这里的,这又是一种循环性的答案。

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

Now, I wanted to go to through this just to go through one cycle quickly because we're going to be doing these all the time, and the importance of the fact that the path doesn't matter, and you can always connect things together in a way, whatever you want.

我使用这种,利用热力学循环的推导方法的原因在于,今后我们，将经常使用类似的方法,大家要记住路径是无关紧要的，可以随意选取一条路径,来连接两个态。

麻省理工公开课 - 热力学与动力学课程节选