It's the outcome of a race one's running faster than all of the other guys and it's as if to have a career at all one has no choice but to come in first.

这里讲的是一项竞赛的结果,某个人比其他所有人跑的都快,就好像这场竞赛中,除了第一你别无选择。

耶鲁公开课 - 弥尔顿课程节选

you can hit the ground running, as we say.

也就是说，你可以立刻进入状态。

写推荐书的人 - SpeakingMax英语口语达人

All right so it has to live in RAM as opposed to the hard drive because otherwise things would be terribly slow as you know so it's much better if your programs live while they're running in RAM and they end up in what's called the tech segment.

好的，它存在内存中，而不是硬盘中,因为，否则程序会非常的缓慢,程序在内存中运行会好得多,它们在技术段,的地方结束。

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

So it's as if that decision is made instantaneously as the shooter is running up.

这就好像所有决定都在,罚球球员起跑的一瞬间完成的

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

As I say, of course, they're all science fiction, but the fact that we can grasp-- and it's not as though we go running away saying, "Oh no! This was outrageous," Right?

正如我所说,的确,这些都只是科幻作品而已,但我们仍然可以从中有所领悟,我们并不会直接走掉,说,哦,不,这实在是太不可思议了,对吗

耶鲁公开课 - 死亡课程节选

I could do this, by the way, by running the code and putting print statements in various places as well, but the hand simulation is valuable, so let me just start it.

做了正确的更新，顺便说一句,我可以通过在很多地方,放置print声明来达到这个目的,但是手工模拟也很有用。

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

All right, so players are making decisions as they're running up.

没错,球员在罚点球之前没有主意

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

So the running time of the problem where the input is T of size N as expressed here formulaically, T of N, the running time of an algorithm, given an input of size N. You know what?

因此一个输入为N的问题的运行时间,在这儿的公式表示为，如果输入为N，那么此算法的运行时间,是多少呢？

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

It at least does corroborate the claim that merge sort N*log N as we argue intuitively is in fact, N log N in running time.

但这至少证实了归并排序,的时间复杂度为。

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

If I'm using algorithm that I'm now calling merge sort, T the running time involved in sorting N elements, T of N, you know, is just the same as running the algorithm for the right half, plus what's this plus N come from?

如果我用归并排序算法，对N个元素其运行时间，就等于此算法一半元素的运行时间,另一半的运行时间，再加上N，这个N是什么呢？

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

So here is the simplest program which is perhaps an ironic statement that you can implement with this language called C. So it takes a few lines of code to actually get something up and running and as you'll recall last Friday, I didn't even get this up and running because part of the process of writing a program is to one, write it.

让我们回到这个最简单的程序,你们也许觉得啼笑皆非，这么简单的例子,用C语言写出来就可以了嘛，的确只需要几行代码,就可以让这个程序跑起来,就像上周五的那样，我之所以没让它跑起来,因为编程步骤之一,就是“写“

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