Or take this value out of memory, run it through some other simple operation, stick it back in memory.
或者从记忆存储器中取出一个结果,在类似的操作中运行,再插回到存储器中。
Try it again. So, sure enough, changing the bias changed the price, and even changed it in the right direction.
我们再来运行一下,好了,很明显,这个偏向值改变了价格,而且方向也是对的。
And these verbal descriptions lead to some pictures that I put up and I'll put up again about how you might try to accomplish something like run an engine or move heat from a colder to a warmer body.
这些言语的描述有助于你们理解我讲过的,而且还要再讲的一些物理图像,比如一台发动机,是怎么运行的,或热怎样从冷的物体传到热的物体。
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是什么呢?
Run merge sort on those. By induction, if it does the right thing, I'm going to get back two lists, and I'm going to then merge Them together. Notice what I'm going to do.
在这些上面再运行归并排序,根据归纳,如果这样是正确的,我将重新得到两个列表,然后我会把它们合并在一起。
And those instructions, by the way, are very simple: they're things like, take the value out of two places in memory, and run them through the multiplier in here, a little piece of circuitry, and stick them back into someplace in memory.
顺便说一句,那些指令非常简单:,他们从记忆存储器中,取出两个位置的结果,在倍增器中运行,一小部分电路,再将它们插回存储器中的某些地方去。
OK, says it says enter a float. I give it something that can be converted into a float, it says fine. I'm going to go back and run it again though. If I run it again, it says enter a float.
好了,看到他说输入一个浮点数,我输入它可以转换为浮点数的值,那没问题,我回过来再运行一遍,如果我再运行一遍。
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.
我现在运行了一对循环,再一次注意这个封装,抽象得很好,这就是我想要的结果,我按这种方式走到这一步的时候,可能会有多组答案。
Now, efficiency is obviously an important consideration when you're designing code, although I have to admit, at least for me, I usually want to at least start initially with code that works, and then worry about how I might go back and come up with more efficient implementation.
现在,当你设计程序的时候效率,是不得不考虑的问题,虽然我必须承认,至少对我来说,我是先担心程序能不能运行,再去把它的效率优化的,我喜欢可靠点的东西。
But, just to be sure, not to be sure, but just to increase my confidence, I'm going to just run it again.
所以说它是对的是很有道理的,但是,确定一下,但是为了提高我们的自信,我要再运行一次。
OK, what I would like you to see is I've been printing out, as I went along, actually let's back up slightly and look at the code. There's merge sort.
好的,我想让你们看就是我运行过后,打印出来的结果,我们再回头看一下这段代码,这就是归并排序,输入一个列表。
Eventually, it's a big program, I run it.
最终组合成一个大程序我再去运行。
Let's run it again.
让我们再运行一次。
The beauty of this is, it keeps me from getting lazy, and not only testing my program and the thing that found the bug, but in all the things that used to work.
运行函数而不用再输入了,这其中的,美妙之处在于,它让我变的勤快了点,并不是仅仅的去测试程序发现bug方面,同样适用于那些正常工作的模块。
But let's run it again, as we've done with all the other tests.
但是让我们再来运行一下,我们做完其他的实验。
And again, if I just run this, just to show that it's going to do the right thing, it says enter base, I'm obnoxious, it says oops, wasn't a float, so we'll be nice about it and I enter a height, and it prints out what I expected. I just concatenated those strings together, by the way, at the end.
我再来运行下看是不是做对了,提示输入底,噢,它提示说不是浮点数,我很高兴,然后我输入一个,浮点数作为高度显示结果和我预期的相同,顺便说一句,我只是在最后把这些字符串连接起来了。
Another way of saying it is, I've actually said, what did I use there, and , It's basically saying there is the first point, there's the second point, add them together and I get that point.
我要去做的是-对不起,再运行一次-好,你可以看到我已经把,这两个点的坐标值加到一块儿了,然后返回了r的值,我会让大家看到我们,实际上得到的是什么,这看起来不错,好,我做了正确的操作。
应用推荐