Back in 2005, when Frank Ruhli was trying to figure out how ancient Egypt's famous boy pharaoh,King Tut,died, he used CT scans.

VOA: standard.2010.05.05

We're going to come back to this row and we're going to figure out not just this equilibrium, but all equilibria.

我们要回到这一排,我们将解决不仅这个均衡,而是所有的均衡

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

And I end up going back and doing unit testing anyway, to try and figure out why it doesn't work. So over the years, I've just convinced myself I might as well start where I'm going to end up.

第一次从来不会正常运行,因此无论如何我还要回头去做单元测试,找找哪儿出错了，因此经过这么多年，我已经说服自己既然一定要做单元测试,那么还是一开始就做最好了。

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

So, I said, okay, I didn't want to assume so we clicked senior and frankly it was then a dead end because apparently to get some senior discount you need to have some special pass or something like this that we didn't have and yet that certainly wasn't obvious here so now we together and this person in particular had to figure out how you go back and then restart this process.

我说，好的，我不希望揣测，所以我点击了老人票,然后问题就来了，因为似乎,需要特殊的号码之类的东西来购买老年票,但是我们没有,明显我们不应该走这步,现在我们一起必须找出,怎样返回，然后重新开始这个步骤。

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

Notice here that it's different than the binary search case. We're certainly dividing down, but the combination now actually takes some work. I'll have to actually figure out how to put them back together. And that's a general thing you want to keep in mind when you're thinking about designing a divide and conquer kind of algorithm.

一个分治的例子,注这里，与二分查找所不同的地方,我们肯定是分解了,但是合并的过程还是需要一些工作量的,我会详细说明怎样把它们合并在一起的,当你在考虑设计一个分治算法时,这是你要必须记住的最基本的东西。

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

And here's a little trick -- and again, we promised to point -- out little tricks of the trade -- if I know I want to execute the last command I typed that started with an m, bangm will actually figure out what that command was and redo it for me so I don't have to figure it out, or you can go back in time in a terminal window.

这里有个小技巧--此外，我们许诺指出行业中的,一些小技巧-,如果我知道我想执行我写入的上一个命令,是以m开头的，！m会明白那个命令是什么,然后为我恢复上次操作,所以我不需要明白它，或者你可以回到,那个终端窗口。

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