It's one element like I claimed before it's sorted and so there's no work to be done.

当有1个元素时，在比较前就知道它是有序的,那就没必要再进行比较了。

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

Now, don't be distracted by the fact that they already appear to be sorted.

现在，貌似它们是有序的,但不要被这一事实干扰。

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

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.

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

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