In the worst-case scenario it could take six months or longer,"

VOA: standard.2009.04.28

What's the complexity of this decision tree solution? Well, in the worst case, we're enumerating every possibility of in and out.

决策树解决方法的复杂度是多少？,在最糟的例子中得列举，所有可能的输入和输出。

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

I see no Mike Smiths because I'm on page 1 A where the A's simply are so I turn to the B's and the C's S and the D's and so forth and finally I get to the S's but in the worst case I've looked through 1,000 or so pages.

第一页没有找到叫Mike，Smith的人1,因为第一页姓名首字母是,于是我又接着找B，C，D……最终到了字母,但最坏的情况是,我翻了几千页才找到。

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

An expert on nuclear proliferation at the RAND Corporation in the United States, Brian Jenkins,says because of its proximity to Somalia and its close ties to the West, Kenya is vulnerable to the worst-case scenario, where an al-Qaida terrorist unleashes a "dirty bomb" in Nairobi causing the death of thousands.

VOA: standard.2009.05.01

Still quadratic, right? I'm looking for the worst case behavior, it's still quadratic, it's quadratic in the length of the list, so I'm sort of stuck with that.

还是平方，对吧,我在寻找最坏的情况，它还是平方，它是列表长度的平方，我对此有点无奈了。

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

I was just finding very tunnel vision-like, the smallest elements at that moment in time which means I don't know anything about the other elements other than they are not the smallest and so no matter what with Selection Sort I had to repeat this again and again and again and if you do out the math it's roughly N squared steps in the worst case as well.

我只有一个狭窄的视野，只知道某时刻的最小元素,就意味着我并不知道其他元素的任何情况,只知道它们不是最小的,所以不管怎样，在选择排序中,我就得一遍一遍地重复选择过程,在最坏情况下,大概需要N的平方次比较。

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

And I'll also remind you, and we're going to see this in the next example, we talked about looking at the worst case behavior. In these cases there's no best case worst case, it's just doing one computation.

我还要提醒大家的就是，我们也会在下一个例子里发现者一点，我们谈到了要去考虑最坏的情况,在下面这些例子里,没有好情况坏情况之分，就只是一次运算。

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

We're going to see an example of that in a second. What we really want to worry about, what's the worst case that happens.

我们接下来就来看一个这样的例子,我们要关注的是，发生的最坏情况是什么呢？

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

The worst case here is, the things not in the list in which case I've got to go all the way through the list to get to the end.

目标数不在数组里,这意味着我必须遍历数组中所有的元素,好，说完了这些。

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

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.

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

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