• "Worst-case scenario, if I don't find a job by the end of August, I move back with my parents."

    VOA: special.2010.06.11

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

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

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

  • 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.

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

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

  • "Even in a worst-case scenario accident, the sea provides a very high degree of dilution.

    VOA: special.2011.03.16

  • So the gentleman here was looking at the worst case scenario, and the woman here was looking at the best case scenario.

    刚才的小伙子看的是最坏的情况,而这位女士看的是最好的情况

    耶鲁公开课 - 博弈论课程节选

  • So really at a worst-case scenario, with the volcano still going strongly, we could get airspace affected for the next few days."

    VOA: standard.2010.04.17

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

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

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

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

    VOA: standard.2009.04.28

  • 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.

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

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

  • 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

  • We're, as a consequence, going to focus on worst case. This is handy for a couple of reasons.

    因此我们会去关注最坏的情况,因为如下的原因这样做。

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

  • The other obvious one to do would be worst case. Again, over all possible inputs to this function, what's the most number of steps it takes to do the 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.

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

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

  • So, as a consequence, we're going to stick with the worst case analysis.

    因此,我们要坚持,对最坏的情况进行分析。

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

  • 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.

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

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

  • The worst case scenario is less bad, is a way of saying it.

    在坏形势下最好的选择是减少损失

    耶鲁公开课 - 博弈论课程节选

  • And by worst case we mean different things.

    而这些情况是由不同的因素造成的。

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

  • The second one is, a lot of the time, the worst case is the one 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.

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

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

  • In general, people focus on worst case.

    总体上来说人们总是。

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

  • We're measuring the worst case.

    这儿最坏的情况就是。

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

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

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

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

  • 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……最终到了字母,但最坏的情况是,我翻了几千页才找到。

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

  • 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的平方次比较。

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

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定