All right? If you run it, you have a sense of the upper bound, about how much time it's going to take to do this computation, so you're not going to get surprised by something showing up.

第一，这样做意味着没有意外了对不对？,你去运行程序,你已经大致知道运行时间的上限了，因此发生任何事情,你都不会吃惊了。

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

You had to be very confident because it was going to take a long time, a fantastic amount of labor, a tremendous amount of money to do that.

你不得不相信,建造一座蜂巢墓要花费很长时间,大量的劳动力,以及庞大的金钱支持

耶鲁公开课 - 古希腊历史简介课程节选

However I do that, I know that should inherently take more time than it takes to compute the average age of all the EECS faculty.

然而我得这么做，我知道,这比计算所有EECS的教员的,平均年龄要,占用更长的时间。

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

I could still do the linear case, which is order n or I could say, look, take the list, let's sort it and then search it. But in that case we said well to sort it was going to take n log n time, assuming I can do that.

我仍然可以做O的线性搜索,或者也可以以这个列表为例，我们先将其进行排序,然后再进行查找，但是在这种情况下,要花费n，log，n的时间去对其进行排序。

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