In fact, it took the same number of steps as it did in the other case, because each time I'm cutting it down by a half.
因为每次我都把问题的规模,缩小一半,这很棒,好,接下来让我们这么做。
And also be well-informed as to what you need to do and the steps you need to take
对于你要做什么,要采取什么步骤,你都要保持消息灵通,
They might have to be formulated as very small steps, in order to do that, but you could.
他们那被构造出来,这些过程必须很小,这好像很难,但实际上是可以做到的。
So even within this framework of, given a description of a computation as a set of steps, in the idea that I could build a circuit to do it, let me suggest for you what would be a wonderful circuit to build.
所以即使需要在将计算描述,当成一系列步骤中的一步,这个框架之内,我也完全可以建立一个线路,来完成那个想法,让我为你们假设能建造起,一个多么棒的线路吧。
So if we went through and drew out our Lewis structure following each of our steps, what we would get is this as our Lewis structure here, and we could figure out all of the formal charges.
那么如果我们按照流程,经过所有的步骤来画路易斯结构,我们会得到这样的路易斯结构,然后我们可以算出所有的形式电荷。
In verse 8, the people solemnly undertake to fulfill the terms of the covenant, so we have at least three of the steps that we find in the Hittite treaties, as well.
诗8中,所有的人庄严的承诺,将履行契约的条款,所以我们至少找了三个步骤,和在Hittite条约中看到的一样。
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的平方次比较。
As long as it's reversible, you know what the efficiency has to be, and in principle, you could break it down into a bunch of steps that you could formulate as isothermal and adiabatic.
只要这个循环过程是可逆的,你们知道效率是多少,从理论上说,可以将总过程,分解成一系列绝热,和等温的小过程。
Or another way of saying it is, we're going to use as the basic steps, those operations that run in constant time, so arithmetic operations.
我们用可以在恒定时间内完成的操作,算法,比较,内存读取。
We're typically going to use as basic steps the built-in primitives that a machine comes with.
我们要用计算机内置的原始体来,定义基本的步骤,换句话说。
As I said, what we want to do is, we want to count the number of basic steps it takes to compute a computation as a function of input size.
我刚才提到了,我们要建立,一个根据输入大小的方法来计算,一个计算过程需要的时间,建立这个方法需要几步呢?
Suppose instead, I want a machine that can take a recipe, the description of a sequence of steps, take that as its input, and then that machine will now act like what is described in that recipe.
假设换成这个,我想要一台可以安装描述,一系列步骤的结果的方法的机器,把那个当做输入设备,然后那台机器可以像方法中,描述的那样运行了。
What we're saying is, in order to do computation, we want to describe recipes, we want to describe this sequence of steps built on some primitives, and we want to describe the flow of control that goes through those sequence of steps as we carry on So the last thing we need before we can start talking about real programming is, we need to describe those recipes.
我们在说,为了做计算,我们想描述一个方法,想描述建立在,相同基本类型上的步骤序列,而且我们想描述经过我们设计的,步骤的序列的,控制流程,因此我们开始谈论真正的编程之前,的最后一件事是,我们需要描述一下那些方法。
应用推荐