-
And in fact, if you look at the top figure it looks as exponential or, quadratic isn't even growing at all.
它看上去是指数型的,而幂次型的看上去,根本没有增长。
-
OK. So this is again an example, this was quadratic, and this one was quadratic.
好的，这又是一个例子了，这是平方次的，这是平方的。
-
If you knew only the third derivative of the function, you can have something quadratic in t without changing the outcome.
如果方程里有三阶导数,你就可以引入一个二次项,但是结果却不会变
-
You can choose a linear interpolation or quadratic, but you've got to choose it.
你可以选择线性插值或抛物线型插值,但你总要做出选择。
-
If I'm running a quadratic algorithm, it'll take one millisecond to complete.
算法会在1毫秒内完成，如果问题的复。
-
We have seen log, linear, quadratic, and exponential.
平方级的和指数级复杂度的方法，再说一遍，可能会有些常量。
-
Log? Linear? Exponential? Quadratic?
对数？线性？指数？平方？
-
So you can see, even the quadratic ones can blow up in a hurry.
如你所见，甚至平方级复杂度的方法。
-
We've seen log, we've seen linear, we've seen quadratic, we've seen exponential.
我们看过了对数级的，线性的，二次平方的，指数级的算法。
-
A linear number of things, quadratic. Right?
线性次遍历，平方，对么？
-
The acceleration gives you an extra stuff, quadratic in time.
加速度对位移有额外贡献,是时间的二次项
-
We saw some quadratic algorithms, typically those are things with multiple nested loops, or iterative or recursive calls, where you're doing, say, a linear amount of time but you're doing it a linear number of times and so it becomes quadratic, and you'll see other polynomial kinds of algorithms.
我们看过一些平方算法，他们一般进行了多次嵌套循环,或者递归迭代调用，对一个线性操作调用线性次,这样就变成平方次了,以后你们能看到,一些多项式算法。
-
So it's quadratic, in terms of that sort.
也就是这种算法是平方级别的。
-
You could do a quadratic, let's say.
像这样。
-
Still quadratic, right? I'm looking for the worst case behavior, it's still quadratic, it's quadratic in the length of the list, so I'm sort of stuck with that.
还是平方，对吧,我在寻找最坏的情况，它还是平方，它是列表长度的平方，我对此有点无奈了。
-
They are going to accompany particles surely as every quadratic equation has two solutions.
他们是成对的粒子,正如每个二次方程都有两个根一样
-
He was trying to describe electrons, but the theory said there are two roots in the quadratic equation and the second root is mathematically as interesting as the first one.
他当时只是想去描述电子,但是数学理论告诉我们,二次方程有两个根,而第二个根在数学上和第一个根一样有趣
-
It is certainly possible, for example, that a quadratic algorithm could run faster than a linear algorithm. It depends on what the input is, it depends on, you know, what the particular cases are. So it is not the case that, on every input, a linear algorithm is always going to be better than a quadratic algorithm.
一个二次平方级复杂度的算法,当然也是可能跑的比线性复杂度算法快的,这取决于，你知道的，输入以及特定的案例，因此并不是对于每个输入,线性复杂度就一定会,比二次平方级复杂度的算法的表现要好,只是通常来说是这样的。
-
Quadratic, linear, log, constant? Any takers?
线性，log，常数？有没有人回答？
-
It says that function, f of x, is bounded above here's an upper limit on it, that this grows no faster than quadratic in n, n squared.
这意味着这个方法f是有上限的,这个方法增长的速度,不会比括号内的n*n快。
-
The order complexity here, if I actually write it would be-- sorry, order n times m, and if m was equal to n, that would be order n squared, and this is quadratic.
如果m等于n的话,也就是n的平方，这是一个平方复杂度的问题，这是和前面不同类型的，好，我在做什么呢？
应用推荐