-
So, for example, if we're to hold the time constant, this makes it a lot simpler of an equation, because what we can end up doing is actually crossing out this whole term here.
比如说，如果我们把时间,定为常数，这使得方程,大大简化，因为我们可以把,这一项划掉。
-
I have constant time access which is great, but I paid a price, which is I had to use up some space.
我的访问时间现在是常数级别，这个非常的棒，但是我也付出了代价，不得不使用更多的空间，在整数的例子中。
-
Okay, so 1 is a viable answer in some contacts that needs constant time, the same amount of time no matter what.
在需要常量时间的情况下,答案是1，不管怎样，总时间是,相同的。
-
And in something like a consumer internet company like Facebook, that constant real time interaction and experimentation is something that the very best entrepreneurs do.
像脸谱网这样的,用户导向型的互联网公司，即时交流，不断试验,是企业家最佳的生财之道。
-
It looks like a tautology because you're never able to show me something that moves forever at a constant velocity, because every time you don't find such a thing, I give an excuse, namely, a force is acting.
这听上去像个死循环,因为你不可能,找到永远匀速运动下去的物体,因为每当你找不到这样的物体时,我就会给出一个理由,也就是,有力作用在上面
-
And the mathematics of that equation involved a double derivative in time of x 0 plus some constant times x equals zero with some constraints on it.
那个数学方程式,包括了x对时间的二阶导数,加上常数乘以x等于,还有一些限制条件。
-
Obviously-- and that's a bad way of saying it, I said constant the previous time-- in the linear case, it's subtract by certain amount.
这么描述很不准确，我之前在，线性算法中也说了常数,它是每次减少固定的量。
-
That one's not so obvious. So let's think about this for a second. To sort a list in linear time, would say, I have to look at each element in the list at most a constant number of times.
所以让我们来思考一会,要在线性时间能排序，列表里每个元素最多被使用常数次,不一定是一次，对吧。
-
Dictionaries are implemented using a magic technique called hashing, which we'll look at a little bit later in the term, which allows us to retrieve keys in constant time.
散列法的内容,此方法可以让我们在线性,时间内检索到键,因此字典的大小并不重要了。
-
Typical characterization, not all the time, but typical characterization, is an algorithm that reduces the size of a problem by one, or by some constant amount each time, is typically an example of a linear algorithm.
我们学习过了线性算法，它的典型特征，不是通用的,但是比较典型的特征是，它是逐一减小问题的大小的，或者说是每次减小常数的大小。
-
And as a consequence, access time in the list is constant, which is what I want.
这会占用一些额外的空间，回到问题本身，这么做的话，读取数组的时间就变成常量了。
-
n So the velocity is given by this product of the quantum number n Planck constant 2 pi mass of the electron time the radius of the orbit, which itself is a function of n.
速度是量子数,普朗克常数2π乘以轨道半径的值,它自身也是n的函数。
-
To get any location in memory, to get to any value of the list, I simply have to say which element do I want to get, I know that these things are stored in a particular size multiply that index by 4, add it to start, and then it's in a constant amount of time I can go to that location and get out the cell.
取得列表中的任何一个值,简单说来，想要取得列表中的任何元素,我知道这些元素存在特定的大小中,把下标乘以4，加到start上,然后定位到内存单元，并取出值就是固定的时间了,好的，如果元素以固定大小存储。
应用推荐