There's one more piece that we'd like to get out of that, and that is-- you may have been wondering, what's with the funky stuttering here of three double-quotes in a row. All right? And that is a specification.
但是你没有屏蔽这个函数的使用细节,在这里我们还想再讲一讲,那就是--你可能正在想,这里连续3个奇怪双引号,是干什么用的。
In the first spot, I'm going to store something that says, here's how far you have to jump to get to the next element.
我们存下下一个,元素的地址偏移量,然后,用之后连续的几个单元。
So what I've said so far is, a particle moving in time from point to point can be represented by a graph, x versus t.
到目前为止,我说过,一个质点随时间的连续运动,可以用一幅x-t图来表示
We have instead what's called a probability density when we have continuous random variables.
所以我们用概率密度的概念来描述,连续型随机变量的情况
Typically up till now, we've looked at things that can be done in sublinear time. Or, at worst, polynomial time. We'll now look at a problem that does not fall into that. And we'll start with what's called the continuous knapsack problem.
至今为止我们已经处理过,亚线性问题,最多也就是多项式问题,我们现在要看的问题则是不能用这些解决的,我们将要开始讲连续背包问题。
应用推荐