• For those of us in the northern hemisphere, Monday is the first day of Winter, which seems a good time to check out a website that's all about the snow.

    VOA: standard.2009.12.19

  • .. And so we are not talking about anything that... Processing our tax returns, unfortunately And it's a one-time check.

    所以我们讲的并不是。,不巧正在处理退税事宜,而且这个是一次性支票。

    斯坦福公开课 - 经济学课程节选

  • So, I've never heard the click-click-click-click-click, and we might bring a Geiger counter in here some time later in the semester so we can check all of you out, and hopefully we won't hear any when we do that either.

    但我知道如果,你听到哒哒哒的声音,就表明你有麻烦了,我从来没听到过哒哒哒的声音,也许以后我可以带一个,来课堂上检测你们每一个人,希望我们不会听到哒哒哒的声音。

    麻省理工公开课 - 化学原理课程节选

  • "With our turtle release program, it is a compensation-based program where when the fishermen give us a call to go and rescue a turtle, we check the biometric measurements, tag the turtle, and compensate the fishermen for the time and effort they have taken to save these turtles and call us."

    VOA: standard.2010.07.15

  • So if you want to check that out after dinner time or so, you can fill that out.

    晚饭或什么时候,想核对了,就可以填好。

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

  • That's certainly one way to do it, but for computers that's not necessarily the easiest way. So another way of solving it is to do something we already saw last time, which is basically, why not simply enumerate all possible examples and check them?

    将一个等式代入另一个等式,这当然是一种办法,但是对电脑来说这绝对不是一件简单的事,所以解决这个问题的办法,正如我们上一次看过的,非常基本?

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

  • I differentiate a second time and check the sign, so the second order condition, I differentiate this expression again with respect to q1.

    我们对它进行二次求导然后看符号,这个式子的二阶导数,就是一阶导数再对q1进行求导

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

  • It finds one syntax error at a time, so you have to be a little patient to do it, but you can check that the syntax is right.

    它一次会找到一个语法错误,所以你们必须要有点耐心,但是你们可以检查出语法是否正确。

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

  • N log N is not nearly as good as log N. As a sanity check, what algorithm have we seen that runs in log N time?

    而N,log,N和log,N并不一样,我们之前探讨过的哪个算法其时间复杂度是log,N呢?

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

  • So supposed that I give you 16 elements to sort, well, following the logic before, the running time involved in sorting 16 elements is gonna be twice the running time 16 of sorting 8 elements, left half and right half plus 16 - and again, a little sanity check, 16 means-- just the merge steps, right?

    现在要对16个元素进行排序,根据之前的逻辑,对16个元素排序,要花的时间是对8个元素排序所花时间的,2倍,分别用于左半部分和右半部分,再加上6,这里16是-,做合并的步数,对吗?

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

  • But that merging process only takes N steps, N*log N so that's N times log of N. Now, it's a little tricky to reason through this perhaps the first time, let's just take a very simple example and see if we can do a little sanity check here.

    但这个合并过程只需要N步,所以时间复杂度是,第一次对此进行推论可能会有点儿棘手,我们举一个简单的例子,看看我们能否做一些完整性的检查。

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

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

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

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