Where are you running off to? I'm not running.
VOA: standard.other
instead of being my program, I'm running, just my ideas We have other people run their programs, have their ideas.
而不是推行我的项目,我来负责,全是我的观点,我们有其他成员实施一些项目,表达他们的观点。
and then I'm calling up and I'm, meanwhile I'm running out of money.
然后我不停地打电话,同时,我的钱也慢慢地用光了。
If I'm running a quadratic algorithm, it'll take one millisecond to complete.
算法会在1毫秒内完成,如果问题的复。
If I'm running through the street alone with a baseball bat smashing through windows, it's me and I know it's me.
如果我自己一个人跑在街上,手里拿着球棒砸窗户,我知道责任在我身上。
The other thing that I want to talk about-- and I guess I'm running out of time-- was about management of disaster risks.
还有一件事,我要说说...,我想我可能快没时间了,我要说的是灾难风险管理
I'm running late. I have a class in 10 minutes.
我要迟到了。还有十分钟就要上课了。
And, now let's go back to, whoops, I'm running out of space.
再看回来,很高兴啊。
I find that every time we do our meditation on Thursday, I'm always running to make it, or something happened before I get there, I'm like "Oh my God, meditation!"
我发现每次我们周四,要冥想时,我总是匆匆赶过去,或者是到达之前发生一点事故,我就好像“天哪,要冥想!“
and I'm making sure that the programme is running to the time it's meant to run by,
我要保证项目要在预定的时间内开展,
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是什么呢?
I want-- I know I'm running you slightly over, I want to do one last example, it's, I also want to be able to do, have variables to store things.
我想-我知道讲的有点多了,我想给大家看最后一个例子,这里我想做的是,通过变量来存储东西。
That does not assume I'm running a search it wants, which one's better?
哪一种更好呢?,未排序的,你们已经考虑到我想说的了?
Third one is, it may depend on which version of Python I'm running.
第三点就是,这可能会和我,用的Python的版本有关系。
The message I'm trying to get to here, because I'm running you right up against time, is I have to be careful about what's a primitive step.
我想说的事情是,因为我正在跟大家讲算法时间复杂度,我们需要注意一个基本步骤的定义,如果我可以假设。
And if I'm running an exponential algorithm, any guesses?
杂度是指数级的呢?,有人猜猜么?
So what's going to happen here? If I'm inside this FOR, OK, and I'm running around, if I ever hit a place where this test is true, I'm going to execute that return, return that return returns from the entire procedure. OK? So the return comes back from the procedure.
那么这里发生了什么呢?,如果我是在这个for循环里面,我正在运行,如果我运行到test的值为真的地方,我就会执行,这个return将会返回整个程序的值,明白了吗?所以它将会从整个程序中返回值。
If I'm running a linear algorithm, it'll take one microsecond to complete.
算法会在1微秒内完成,如果是一个平方级的方法。
If I'm running at nanosecond speed, 1000 n, the size of the problem, whatever it is, is 1000, and I've got a log algorithm, it takes 10 nanoseconds to complete.
如果这个问题的规模,也就是n,是,如果这个问题是对数级的,这将会占据10纳秒的时间,你一眨眼的时间。
OK, so what have I done? I just added a little bit more now. I'm now running through a pair of loops. Again notice the encapsulation, that nice abstraction going on, which is what I want. Once I get to this stage though by the way, there might be more than one solution.
我现在运行了一对循环,再一次注意这个封装,抽象得很好,这就是我想要的结果,我按这种方式走到这一步的时候,可能会有多组答案。
We have--my colleagues and I founded an investment bank called Macro Markets and I'm not actually running it, I'm co-found--it's named after a book Macro Markets I wrote called Marco Markets.
在我大学时代我们建立了一个投资银行,叫做Macro,Markets,我并没有实际经营它,这个投行以我写过的一本书来命名,我写的那本书就叫做。
God bless. Oh, sorry, that wasn't a sneeze, it was a two? How many swaps do I do in bubble sort? A lot. Right. Potentially a lot because I'm constantly doing that, that says I'm running that inner loop a whole bunch of times.
上帝保佑,哦,抱歉,我没说清楚,这是两个问题,在冒泡排序中要做多少次排序?许多,正确的,可能要做很多次,因为在持续的干,这就意味着它要做很多次内部循环。
That's the question we're going to try and address. If we can do this, this is good, because first of all, it removes any questions about what machine I'm running on, it's talking about fundamentally, how hard is this problem, and the second thing is, it is going to do it specifically in terms of the input. Which is one of the things that I was worried about.
这是一个我们接下来要去,尝试和解决的问题,如果我们能做到的话会很不错,因为首先,它解决了结果可能和我,运行的计算机有关系的问题,因为这从根本了告诉了,我们这个问题的复杂度,第二件事情,就是这种方法可以依据输入的大小来计算,而这正是我最担心的地方。
Imagine I have a little lamp, a little goose- one of those little gooseneck lamps, I'd put it on the table here, I'd put the height about a f-- about a foot off the table. And if I was really good, - I could hit, or time it so that when I hurt- yeah, try again. When I turn this on switch on in the lamp, at exactly the same time, I'm going to hit a key on my computer and start it running.
想象下我有一个那种小雁颈台灯-,我把它放在桌子上,大概离桌子,有一英尺那么高吧,这样挺好的,我可以打开-,或者关闭这灯,并在这同时,我可以让我电脑,开始运行。
应用推荐