Now in order to illustrate the way in which what Iser calls virtual work gets done in this regard, let me just run through a few passages quickly.

现在，为了阐释,在这点上，伊瑟尔所说的虚功是怎样做的，下面我们来快速地浏览几段话。

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

Really there's no work to be done if I am handed all in sorted order so, you know, There's no work to be done if I'm handed all of the arrays in sorted order so, you know, if I demand that you give me this assumption that the cups are already sorted and then I'll sort them for you, I mean, this is kind of a cyclical argument.

如果杯子是有序排列的,那就没必要再对它进行排序了，同样如果给出的序列本身就是有序的,那也不必再做什么，如果给出这样的假设：,杯子已经有序，但仍需要对其进行排序，这像是个循环的论点。

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

And then one of the things that I suggested was that if we could figure out some way to order it, and in particular, if we could order it in n log n time, and we still haven't done that, but if we could do that, then we said the complexity changed a little bit.

这就涉及到了排序,如果可以想出一种来将其进行排序,甚至可以在n，log，n的时间内完成,虽然目前我们没做这件事,但是一旦开始做这件事,那么复杂性就是发生一些变化。

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

But as soon as the most recently called function finishes executing, you have to take that tray off the stack in order to get at the previous function's memory, and once he's done executing, you have to take that one off and then what's left well then main.

但是，一旦新的调用函数结束了执行,你必须从堆中把托盘拿掉,用来获得先前函数的内存，一旦他完成执行，你必须把那一块拿下来,然后剩下的是main函数。

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