我们比你知道的多。
拥有的要比你显露的多,说的要比你知道的少。
当我还是你这个年龄时,我比你知道的少的多。
I want to show you how easy it is to change the code. But, notice, once I've added this I actually have a problem. This is now an under-constrained problem. I have more unknowns than I have equations.
我加上这个条件后,我马上面临一个问题了,这就是现在是一个非约束性问题了,我的未知数比方程数多,你从代数中可以知道。
It's not always how it is on like things like the Hills and stuff like that. And you know, it's...
事情不总是像比佛利山庄那里那样的。你知道……
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.
一个二次平方级复杂度的算法,当然也是可能跑的比线性复杂度算法快的,这取决于,你知道的,输入以及特定的案例,因此并不是对于每个输入,线性复杂度就一定会,比二次平方级复杂度的算法的表现要好,只是通常来说是这样的。
应用推荐