Well here is my array of 8, you know what, it's too much work to sort all 8.

这是有8个杯子的一个序列，要对这8个杯子进行排序就会花费较大功夫。

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

And the context of sorting, the worst case is your handed a problem that's in complete reverse order because that implies you have - to do as more work that could possibly-- that you could-- you have to do more work than you would of course if things were in perfect order.

在排序的环境中，最糟糕的情况是待排序的序列是,完全逆序的，在这种情况下,你不得不做更多的工作-,比起一个较理想顺序的序列,你必须花费更多的努力。

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

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.

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

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