And so you care-- you care about ultimately how much time is my algorithm gonna take to perform on that worst case running time.

因此你最终所关心的是,算法在最坏情况下需要多长的,运行时间。

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

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.

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

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

N --O So we introduced this notation big O which generally refers to worst case.

的平方。，So，，N，squared。,这里我们介绍一个符号,它泛指最坏的情况。

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